Pagini recente » Cod sursa (job #2453778) | Cod sursa (job #23662) | Cod sursa (job #2967007) | Cod sursa (job #1931757) | Cod sursa (job #2728678)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,t[100005];
int caut(int x)
{
if(x==t[x])return x;
else return t[x]=caut(t[x]);
}
int unesc(int x, int y)
{
t[caut(x)]=caut(y);
}
int main()
{
fin>>n>>m;
for(int i=1;i<=n;++i)t[i]=i;
for(int i=1;i<=m;++i)
{
int c,x,y;
fin>>c>>x>>y;
if(c==1)unesc(x,y);
else
{
if(caut(x)==caut(y))fout<<"DA"<<'\n';
else fout<<"NU"<<'\n';
}
}
return 0;
}