Cod sursa(job #705921)

Utilizator ms-ninjacristescu liviu ms-ninja Data 5 martie 2012 10:26:25
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.86 kb
//#include <fstream>
#include <cstdio>
using namespace std;
//ifstream fin("disjoint.in");
//ofstream fout("disjoint.out");
#define dim 100005
int t[dim], r[dim];
int n, m;

void read()
{
	//fin>>n >>m;
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;++i)
		t[i]=i;
}
	
int find(int x)
{
	if(x!=t[x])
		t[x]=find(t[x]);
	return t[x];
}

inline void unite(int x, int y)
{
	if(r[x]<r[y])
		t[x]=y;
	else
		t[y]=x;
	if(r[x]==r[y])
		++r[x];
}

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

int main()
{
	freopen ("disjoint.in","r",stdin);
	freopen ("disjoint.out","w",stdout);
	read();
	solve();
	
	return 0;
}