Pagini recente » Cod sursa (job #1606567) | Cod sursa (job #2845043) | Cod sursa (job #1436853) | Cod sursa (job #74092) | Cod sursa (job #3253589)
#include <iostream>
using namespace std;
int p[100005];
int root(int a)
{
while(p[a] != a)
a = p[a];
return a;
}
void unite(int a, int b)
{
a = root(a);
b = root(b);
if(p[a] != p[b])
p[a] = b;
}
int main()
{
int n, m;
cin>>n>>m;
for(int i=1;i<=n;i++)
p[i] = i;
int c, a, b;
for(int i=1;i<=m;i++)
{
cin>>c>>a>>b;
if(c == 1) unite(a, b);
else if(c == 2)
{
if(root(a) == root(b))
cout<<"DA";
else
cout<<"NU";
cout<<'\n';
}
}
return 0;
}