Cod sursa(job #673599)
| Utilizator | Data | 4 februarie 2012 17:54:05 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <cstdio>
using namespace std;
int v[100005];
int tatal(int x)
{
while(v[x]!=0)
{
x=v[x];
}
return x;
}
int main()
{
int n,m,x,y,t;
freopen("disjoint.in","r", stdin);
freopen("disjoint.out","w", stdout);
scanf("%d %d",&n,&m);
for(int i=1;i<=m;i++)
{
scanf("%d %d %d",&t,&x,&y);
if(t==1)
v[tatal(x)]=y;
if(t==2)
if(tatal(x)==tatal(y))
printf("DA\n");
else printf("NU\n");
}
return 0;
}
