Cod sursa(job #527084)
| Utilizator | Data | 30 ianuarie 2011 16:33:27 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#define nmax 100042
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int T[nmax];
inline int multime(int nod)
{
while(T[nod])
nod=T[nod];
return nod;
}
int main()
{
int N,M,x,y,op;
in>>N>>M;
while(M--)
{
in>>op>>x>>y;
if(op==1)
T[x]=y;
else
if(multime(x)==multime(y))
out<<"DA\n";
else out<<"NU\n";
}
return 0;
}
