Pagini recente » Cod sursa (job #2201219) | Cod sursa (job #1504233) | Cod sursa (job #2298514) | Cod sursa (job #1038864) | Cod sursa (job #3012543)
#include<cstdio>
using namespace std;
FILE*in=fopen("disjoint.in","r");
FILE*out=fopen("disjoint.out","w");
const int NMAX=100007;
int n,m,i,c,d,e;
int dad[NMAX],dep[NMAX];
int fd(int x)
{
if(dad[x]==0)
{
return x;
}
int g=fd(dad[x]);
dad[x]=g;
return g;
}
void uni(int x,int y)
{
int a,b;
a=fd(x);
b=fd(y);
if(dep[a]<dep[b])
{
dad[a]=b;
}
else if(dep[a]>dep[b])
{
dad[b]=a;
}
else
{
dad[a]=b;
dep[b]++;
}
}
int main()
{
fscanf(in,"%d%d",&n,&m);
for(i=1;i<=m;i++)
{
fscanf(in,"%d%d%d",&c,&d,&e);
if(c==1)
{
uni(d,e);
}
else
{
if(fd(d)==fd(e))
{
fprintf(out,"DA\n");
}
else
{
fprintf(out,"NU\n");
}
}
}
}