Cod sursa(job #2817500)
Utilizator | Gheorghe Sonia sghexghe | Data | 13 decembrie 2021 18:55:28 |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.71 kb |
#include<fstream>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int v[100002],val;
int sef(int a)
{
if(v[a]==a)
return a;
else
{
return v[a]=sef(v[a]);
}
}
void unific(int a,int b)
{
int s1,s2;
s1=sef(a);
s2=sef(b);
v[s2]=s1;
}
int main()
{
int i,n,m,j,op,x,y;
cin>>n>>m;
for(i=1;i<=n;i++)
v[i]=i;
for(i=1;i<=m;i++)
{
cin>>op>>x>>y;
if(op==1)
{
unific(x,y);
}
else
{
if(sef(x)!=sef(y))
cout<<"NU"<<"\n";
else
cout<<"DA"<<"\n";
}
}
return 0;
}