Pagini recente » Cod sursa (job #612221) | Cod sursa (job #1203231) | Cod sursa (job #1951795) | Cod sursa (job #2503737) | Cod sursa (job #2090000)
#include <iostream>
#include <cstdio>
using namespace std;
int t[100001];
int tata(int x)
{
if (t[x]!=x)
t[x]=tata(t[x]);
return t[x];
}
void join(int x,int y)
{
int rx=tata(x);
int ry=tata(y);
t[ry]=x;
}
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;
}