Pagini recente » Cod sursa (job #706882) | Cod sursa (job #794602) | Cod sursa (job #989242) | Cod sursa (job #2039527) | Cod sursa (job #2473862)
#include <bits/stdc++.h>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int n,m,tata[100010];
int c,x,y;
int bigdaddy(int dad)
{
if(tata[dad]==0)
return dad;
return bigdaddy(tata[dad]);
}
void mergedads()
{
tata[bigdaddy(x)]=bigdaddy(y);
}
int main()
{
in>>n>>m;
for(int i=1;i<=m;i++)
{
in>>c>>x>>y;
if(c==1)
{
mergedads();
}
else
{
if(bigdaddy(x)==bigdaddy(y))
out<<"DA\n";
else
out<<"NU\n";
}
}
return 0;
}