Cod sursa(job #760480)
Utilizator | Data | 21 iunie 2012 16:52:32 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<cstdio>
using namespace std;
int x,y,tip,x1,y1,n,m,i,t[100002];
int tata(int x)
{
while(t[x]!=0) x=t[x];
return x;
}
int main()
{
freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);
scanf("%d %d",&n,&m);
for(i=1;i<=m;i++)
{
scanf("%d",&tip);
scanf("%d",&x);
scanf("%d",&y);
if(tip==1)
{
x1=tata(x);
y1=tata(y);
t[x1]=y1;
}
else
{
x1=tata(x);
y1=tata(y);
if(x1==y1) printf("DA\n");
else printf("NU\n");
}
}
return 0;
}