Pagini recente » Cod sursa (job #41871) | Cod sursa (job #1026791) | Cod sursa (job #1041033) | Cod sursa (job #1013934) | Cod sursa (job #1899083)
#include <fstream>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int m,n,tata[100001],v[100001];
int radacina (int x)
{
while(tata[x]!=x)
x=tata[x];
return x;
}
int main()
{
int r1,r2;
int o,x,y;
cin>>n>>m;
for(int i=1;i<=n;i++)
tata[i]=i;
for(int i=1;i<=m;i++)
{
cin>>o>>x>>y;
if(o==1)
{
r1=radacina(x);
r2=radacina(y);
if(r1!=r2)
{
if(v[r1]>v[r2])
tata[r2]=r1;
else
if(v[r2]>v[r1])
tata[r1]=r2;
else
tata[r1]=r2,v[r1]++;
}
}
if(o==2)
{
r1=radacina(x);
r2=radacina(y);
if(r1==r2)
cout<<"DA\n";
else
cout<<"NU\n";
}
}
return 0;
}