Cod sursa(job #2837352)

Utilizator razvanalexrotaruRazvan Alexandru Rotaru razvanalexrotaru Data 22 ianuarie 2022 10:01:18
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.79 kb
#include <bits/stdc++.h>
#define NMAX 100008
#define cin fin
#define cout fout
using namespace std;
ifstream cin ("disjoint.in");
ofstream cout ("disjoint.out");
int tata[NMAX],h[NMAX];
int n,m,i,x,y,cd,p;
int find(int x)
{
	int r=x,y;
	while(tata[r]!=r)
        r=tata[r];
	for (;tata[x]!= x;)
	{
		tata[x]=r;
		x=tata[x];
	}
	return r;
}
void unite(int x, int y)
{
	if(h[x]>h[y])
		tata[y]=x;
			else
            tata[x]=y;
	if(h[x]==h[y])
        h[y]++;
}
int main()
{
    cin>>n>>m;
	for(i=1;i<=n;i++)
	{
		tata[i]=i;
		h[i]=1;
	}
	for(i=1;i<=m;i++)
	{
	    cin>>p>>x>>y;
		if(p==2)
        {
			if(find(x)==find(y))
                cout<<"DA"<<'\n';
				else
				cout<<"NU"<<'\n';
		}
        else
        unite(find(x),find(y));
	}

	return 0;
}