Pagini recente » Cod sursa (job #3341133) | Cod sursa (job #3339431) | Cod sursa (job #3335763) | Cod sursa (job #1645920) | Cod sursa (job #3317625)
#include <fstream>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int sef[100001];
int boss(int x)
{
if(sef[x]==x)
return x;
else
return sef[x]=boss(sef[x]);
}
void unire(int x,int y)
{
int sx=boss(x);
int sy=boss(y);
sef[sy]=sx;
}
int main()
{
int n,m,c,x,y;
cin>>n>>m;
for(int i=1;i<=n;i++)
sef[i]=i;
for(int i=1;i<=m;i++)
{
cin>>c>>x>>y;
if(c==1)
unire(x,y);
else
{
if(boss(x)==boss(y))
cout<<"DA";
else
cout<<"NU";
cout<<'\n';
}
}
return 0;
}