Pagini recente » Cod sursa (job #614382) | Cod sursa (job #826240) | Cod sursa (job #3143297) | Cod sursa (job #360785) | Cod sursa (job #2977203)
#include<bits/stdc++.h>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int n,m,cod,x,y,h[100005],t[100005];
int rad(int x)
{int r=x;
while(t[r]!=r)
r=t[r];
return r;
}
void unif(int x, int y)
{
if(h[x]<h[y]) t[x]=y;
else t[y]=x;
if(h[x]==h[y]) h[x]++;
}
int main()
{in>>n>>m;
for(int i=1;i<=n;i++)
h[i]=i,t[i]=i;
for(int i=1;i<=m;i++)
{in>>cod>>x>>y;
if(cod==1) unif(x,y);
else
{
if(rad(x)==rad(y)) out<<"DA\n";
else out<<"NU\n";
}
}
return 0;
}