Cod sursa(job #852043)

Utilizator Luncasu_VictorVictor Luncasu Luncasu_Victor Data 10 ianuarie 2013 19:39:59
Problema Paduri de multimi disjuncte Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 1.02 kb
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <cassert>
using namespace std;

#define PRO "disjoint"
void OpenFiles(int EVAL)
{
	if(EVAL)
	{
		char input[100] = PRO, output[100] = PRO;
		freopen(strcat(input, ".in"),"r",stdin);
		freopen(strcat(output,".out"),"w",stdout);
	} else
	{
		freopen("test.in","r",stdin);
		freopen("test.out","w",stdout);
	}
}

#define MAX 100001
#define INF 0xffffff

int n,m,rad[MAX];

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

int main(int argv,char *args[])
{
	OpenFiles(argv==0);	
	// start
	int m,op,x,y;
		scanf("%d %d",&n,&m);
		for(int i=1;i<=n;i++) rad[i] = i;
		for(int i=1;i<=m;i++)
		{
			scanf("%d %d %d",&op,&x,&y);
			if(op==1)
			{
				rad[x] = tata(y);
			} else
				printf("%s\n",tata(x)==tata(y)?"DA":"NU");
		}
	return 0;
}