Cod sursa(job #1472590)

Utilizator ArkinyStoica Alex Arkiny Data 17 august 2015 13:21:06
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.01 kb
#include<iostream>
#include<fstream>
using namespace std;

ifstream in("disjoint.in");
ofstream out("disjoint.out");

#define MAX 100001

unsigned int A[MAX];

int N, M;

int Find(int e)
{
	if (A[e] & 0XFFFFFF)
	{
		A[e] = Find(A[e]);
		return A[e];
	}
	else
		return e;

}

void Add(int x, int y)
{
	x = Find(x);
	y = Find(y);

	if (A[x] & 0xFF000000 > A[y] & 0xFF000000)
		A[y] = (A[y] & 0xFF000000) | x;
	else if (A[x] & 0xFF000000 < A[y] & 0xFF000000)
		A[x] = (A[x] & 0xFF000000) | y;
	else
	{
		A[x] = (A[x] & 0xFF000000) | y;
		A[y] = (A[y] & 0xFFFFFF) | (((A[y] & 0xFF000000)>>24 +1)<<24);
	}

}

void operation(int e,int x,int y)
{
	switch (e)
	{
	case 1:
		Add(x, y);
		break;
	case 2:
		x= Find(x);
		y = Find(y);
		if (x == y)
			out << "DA\n";
		else
			out << "NU\n";
		break;
	}
}

int main()
{
	in >> N >> M;
	int op, x, y;
	for (int i = 1;i <= M;++i)
	{
		in >> op >> x >> y;
		operation(op, x, y);
	}

	in.close();
	out.close();
	return 0;
}