Cod sursa(job #662085)

Utilizator angi.nNeata Angelica angi.n Data 15 ianuarie 2012 20:14:27
Problema Paduri de multimi disjuncte Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include<fstream>
#include<iostream>
#include<stdlib.h>

 using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
//se merge in spate pana se ajunge la tatal initial
int find_r(int *v,int x)
{
	if(x==v[x])
		return x;
	return find_r(v,v[x]);
}

int main()
{
	int *v,n,i,m,j,op,x,y,rad_x,rad_y;
	in>>n;
	//alocarea vectorului
	v=( int *)malloc((n+1)*sizeof( int ));
	//padurea disjuncta
	for(i=1;i<=n;i++)
		v[i]=i;
	in>>m;
	for(j=1;j<=m;j++)
	{
		in>>op;
		in>>x>>y;
		if(op==1)
		{
			v[find_r(v,y)]=find_r(v,x);		
		}
		else
		{
			if(v[x]==v[y])
				out<<"DA"<<"\n";
			else
				out<<"NU"<<"\n";
		}
	}
	free(v);
	in.close();
	out.close();
return 0;
}