Pagini recente » Cod sursa (job #1666098) | Cod sursa (job #303369) | Cod sursa (job #221127) | Cod sursa (job #1929436) | Cod sursa (job #2089985)
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
int t[100001];
int tata(int x)
{
if (t[x]==x)
return x;
return t[x]=tata(t[x]);
}
void join(int x,int y)
{
x=tata(x);
y=tata(y);
t[x]=t[y];
}
int main()
{
freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);
int n,m,tip,x,y;
cin>>n>>m;
for (int i=1;i<=n;i++)
t[i]=i;
for (int i=1;i<=m;i++)
{
cin>>tip>>x>>y;
if (tip==1)//reuniune
join(x,y);
else //intrebare
if (tata(x)==tata(y))
cout<<"DA\n";
else
cout<<"NU\n";
}
return 0;
}