Cod sursa(job #3367669)

Utilizator Iatagan_TEO12Iatagan Teodora Iatagan_TEO12 Data 9 octombrie 2026 17:24:12
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.63 kb
#include <fstream>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int sef[100001];
int sef_suprem(int nod){
	if(sef[nod]==nod)
		return nod;
	return sef[nod]=sef_suprem(sef[nod]);
}
void unire(int x,int y){
	int sefx=sef_suprem(x);
	int sefy=sef_suprem(y);
	sef[sefx]=sefy;
}
int main()
{
	int n,m,i,op,a1,a2,s1,s2;
	cin>>n>>m;
    for(i=1;i<=n;i++)
		sef[i]=i;
	for(i=1;i<=m;i++){
		cin>>op>>a1>>a2;
		if(op==1)
			unire(a1,a2);
		else{
			s1=sef_suprem(a1);
			s2=sef_suprem(a2);
			if(s1==s2)
				cout<<"DA";
			else
				cout<<"NU";
			cout<<'\n';
		}
	}

    return 0;
}