Cod sursa(job #2061214)

Utilizator ScarymovieMocanu Alexandru Scarymovie Data 8 noiembrie 2017 23:25:43
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.81 kb
#include <fstream>
#define NMAX 100002
using namespace std;
int tata[NMAX],h[NMAX],n,m;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int CautaTata(int x)
{
    int aux=x;
    while(tata[x]) x=tata[x];
    while(tata[aux]){int aux2=tata[aux];tata[aux]=x;aux=aux2;}
    return x;
}
void UnesteArbori(int x,int y)
{
    x=CautaTata(x);
    y=CautaTata(y);
    if(h[x]>h[y]) {tata[x]=y;return;}
    else if(h[x]==h[y]) h[y]++;
    tata[y]=x;
}
void Query(int x,int y)
{
    x=CautaTata(x);
    y=CautaTata(y);
    if(x==y) g<<"DA\n";
    else g<<"NU\n";
}
int main()
{
    f>>n>>m;
    int i,t,x,y;
    for(i=1;i<=n;++i) h[i]=1;
    for(i=0;i<m;++i)
        {
            f>>t>>x>>y;
            if(t-2) UnesteArbori(x,y);
            else Query(x,y);
        }
    return 0;
}