Pagini recente » Cod sursa (job #811511) | Cod sursa (job #2751605) | Cod sursa (job #1533118) | Cod sursa (job #2641812) | Cod sursa (job #2330710)
#include <bits/stdc++.h>
using namespace std;
int T[100005];
int sef(int x)
{
if(x==T[x])
return T[x];
return T[x] = sef(T[x]);
}
void join(int x, int y)
{
T[sef(y)]=sef(x);
}
int main()
{
freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);
int n, m, cod, x, y, i;
cin>>n>>m;
for(i = 1; i<=n; i++)
T[i]=i;
for(i = 1; i<=m; i++)
{
cin>>cod>>x>>y;
if(cod==1)
join(x, y);
else
{
(sef(T[x])==sef(T[y]))? cout<<"DA\n" :cout<<"NU\n";
}
}
return 0;
}