Cod sursa(job #1013596)
| Utilizator | Data | 21 octombrie 2013 12:08:10 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
int t[100001];
int radacina(int x) {
if(t[x]==0)
return x;
t[x]=radacina(t[x]);
return t[x];
}
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int main()
{int m,n,i,x,y,cod,rx,ry;
in>>n>>m;
for(i=1;i<=m;i++)
{in>>cod>>x>>y;
rx=radacina(x);
ry=radacina(y);
if(cod==1)
t[ry]=rx;
else
if (rx==ry)
out<<"DA"<<"\n";
else
out<<"NU"<<"\n";
}
}
