Cod sursa(job #555660)

Utilizator paul992Cirstean Paul paul992 Data 15 martie 2011 17:48:36
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.62 kb
#include<stdio.h>
using namespace std;
int n,m,tata[100001];

void read()
{
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++)
	tata[i]=i;
}

void unite(int x,int y)
{tata[x]=y;}

int father(int x)
{
if(tata[x]!=x)
	tata[x]=father(tata[x]);
return tata[x];
}

void solve()
{int x,y,tip,t1,t2;
for(int i=1;i<=m;i++)
	{
	scanf("%d %d %d",&tip,&x,&y);
	t1=father(x);
	t2=father(y);
	
	if(tip==1)
		unite(t1,t2);
	else
		{if(t1==t2)
			printf("DA\n");
		else
			printf("NU\n");
		}
	}
}


int main()
{freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);

read();
solve();

return 0;}