Cod sursa(job #712649)
Utilizator | giulia petre giuliutza | Data | 13 martie 2012 18:09:44 |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
# include <iostream>
# include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int T[100001],N,M,x,y,cod;
int radacina(int nod)
{
int r;
if(T[nod]==0)
return nod;
r=radacina(T[nod]);
T[nod]=r;
return r;
}
int main()
{
int i,rx,ry;
in>>N>>M;
for(i=1;i<=M;i++)
{
in>>cod;
in>>x>>y;
if(cod==1)
{
rx=radacina(x);
ry=radacina(y);
T[y]=rx;
}
if(cod==2)
{
if(radacina(x)==radacina(y))
out<<"DA"<<endl;
else
out<<"NU"<<endl;
}
}
return 0;
}