Cod sursa(job #517833)

Utilizator auRSTARHreapca Aurelian auRSTAR Data 29 decembrie 2010 23:17:04
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.77 kb
#include<cstdio>
#define min(a,b) a<b?a:b
#define max(a,b) a>b?a:b
void read(),solve();
int x,y,i,n,m,dad[100010],c;
int main()
{
	read();
	solve();
	return 0;
}
void read()
{
	freopen("disjoint.in","r",stdin);
	freopen("disjoint.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++)dad[i]=i;
}
void solve()
{
	for(i=1;i<=m;i++)
	{
		scanf("%d%d%d",&c,&x,&y);
		if(c==1)
		{
			if(x!=dad[x])while(dad[x]!=dad[dad[x]])dad[x]=dad[dad[x]];
			if(y!=dad[y])while(dad[y]!=dad[dad[y]])dad[y]=dad[dad[y]];
			dad[max(dad[x],dad[y])]=min(dad[x],dad[y]);
			continue;
		}
		if(x!=dad[x])while(dad[x]!=dad[dad[x]])dad[x]=dad[dad[x]];
		if(y!=dad[y])while(dad[y]!=dad[dad[y]])dad[y]=dad[dad[y]];	
		if(dad[x]==dad[y])printf("DA\n");else printf("NU\n");
	}
}