Cod sursa(job #1235434)
| Utilizator | Data | 29 septembrie 2014 19:29:31 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
#define cout g
#define nmax 100010
int n,m,i,x,y,tip;
int T[nmax];
inline int rad(int x)
{
if (x!=T[x]) T[x]=rad(T[x]);
return T[x];
}
int main()
{
f>>n>>m;
for(i=1;i<=n;++i) T[i]=i;
for(;m;--m)
{
f>>tip>>x>>y;
if(tip==1) T[rad(x)]=rad(y);
else if(rad(x)==rad(y)) cout<<"DA\n";
else cout<<"NU\n";
}
return 0;
}
