Cod sursa(job #1283645)

Utilizator frantiu.andreiFrantiu Andrei Mihai frantiu.andrei Data 5 decembrie 2014 21:39:26
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.7 kb
#include<fstream>
#define NMax 100005

using namespace std;

ifstream f("disjoint.in");
ofstream g("disjoint.out");

int N,M,TT[NMax],RG[NMax];

void unite(int x, int y)
{
    if(RG[x]<RG[y])
        TT[x]=y;
    if(RG[y]<RG[x])
        TT[y]=x;
    if(RG[x]==RG[y])
    {
        TT[x]=y;RG[y]++;
    }
}
int find(int x)
{
    while(x!=TT[x])
        x=TT[x];

    return x;
}
int main()
{
int op,x,y;
f>>N>>M;
for(int i=1;i<=N;i++)
{
    TT[i]=i;
    RG[i]=0;
}
while(M--)
    {
    f>>op>>x>>y;
    if (op==1)
        unite(find(x),find(y));
    if(op==2)
        if(find(x)==find(y))
            g<<"DA\n";
        else
            g<<"NU\n";
    }
return 0;
}