Pagini recente » Cod sursa (job #1102320) | Cod sursa (job #2810434) | Cod sursa (job #2532981) | Cod sursa (job #537127) | Cod sursa (job #2942375)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int tip[100005],cnt[100005];
int parinte(int u)
{
while(tip[u]!=u)
u=tip[u];
return u;
}
void join(int a, int b)
{
a=parinte(a),b=parinte(b);
if (a!=b)
if (cnt[a]>cnt[b])
swap(a, b);
tip[b]=a;
cnt[a]+=cnt[b];
}
int main()
{
int n,m,i,j,op,x,y;
cin>>n>>m;
for(i=1; i<=n; i++)
tip[i]=i;
for(i=1; i<=m; i++)
{
cin>>op>>x>>y;
if(op==1)
join(x,y);
else
{
if(tip[x]==tip[y])
cout<<"DA";
else
cout<<"NU";
cout<<'\n';
}
}
return 0;
}