Pagini recente » Cod sursa (job #2705407) | Cod sursa (job #1795696) | Cod sursa (job #1852210) | Cod sursa (job #280287) | Cod sursa (job #2629773)
#include <bits/stdc++.h>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int n,q,p[100001],v[100001];
int main()
{ in>>n>>q;
while(q--)
{ int t,x,y;
in>>t>>x>>y;
if(t==1)
{ while(p[x]!=0)
x=p[x];
while(p[y]!=0)
y=p[y];
if(v[x]<v[y])
swap(x,y);
p[y]=x;
v[x]+=v[y];
}
else
{ while(p[x]!=0)
x=p[x];
while(p[y]!=0)
y=p[y];
if(x==y)
out<<"DA\n";
else
out<<"NU\n";
}
}
in.close();
out.close();
return 0;
}