Cod sursa(job #640232)
| Utilizator | Data | 24 noiembrie 2011 22:48:47 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int T[100002],N,M,x,y,c;
int multime(int x)
{
if(!T[x])
return x;
else return multime(T[x]);
}
int main()
{
in>>N>>M;
while(M--)
{
in>>c>>x>>y;
x = multime(x);
y = multime(y);
if(c==1)
T[x]=y;
else if(x==y)
out<<"DA\n";
else out<<"NU\n";
}
return 0;
}
