Pagini recente » Cod sursa (job #953422) | Cod sursa (job #2260521) | Cod sursa (job #2387530) | Cod sursa (job #3178555) | Cod sursa (job #3250434)
#include <bits/stdc++.h>
using namespace std;
int p[1000005];
int get(int u)
{
if(p[u] == u) return u;
return p[u] = get(p[u]);
}
void unite(int a, int b)
{
a = get(a);
b = get(b);
if(a != b)
p[a] = b;
}
int main()
{
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int n, q, cer, a, b;
cin>>n>>q;
for(int i=1; i<=n; i++)
p[i] = i;
for(int i=1; i<=q; i++)
{
cin>>cer>>a>>b;
if(cer == 1)
unite(a, b);
else if(cer == 2)
{
if(get(a) == get(b))
cout<<"DA";
else
cout<<"NU";
cout<<'\n';
}
}
return 0;
}