Cod sursa(job #688080)

Utilizator okros_alexandruOkros Alexandru okros_alexandru Data 22 februarie 2012 23:41:50
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#include<fstream>
#define NMAx 100100
using namespace std;
int n,T[NMAx],Gr[NMAx];

void unite(int x,int y) {
	
	if(Gr[x]>Gr[y])
		T[y]=x;
	else
		T[x]=y;
	
	if(Gr[x]==Gr[y])
		Gr[y]++;
	
}
int dfs(int nod) {
	
	if(T[nod]!=nod)
		T[nod]=dfs(T[nod]);
	return T[nod];
	
}
int main() {
	
	int i,x,y,cod,m;
	ifstream in("disjoint.in");
	ofstream out("disjoint.out");
	in>>n>>m;
	
	for(i=1;i<=n;i++) {
		T[i]=i;
		Gr[i]=1;
		}
	
	for(i=0;i<m;i++) {
		in>>cod>>x>>y;
		
		if(cod==1)
			unite(dfs(x),dfs(y));
		else
		if(dfs(x)==dfs(y))
			out<<"DA\n";
		else
			out<<"NU\n";
		}
	
	in.close();
	out.close();
	
	return 0;
	
}