Pagini recente » Cod sursa (job #2695914) | Cod sursa (job #2742448) | Cod sursa (job #2976127) | Cod sursa (job #1314779) | Cod sursa (job #3317611)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int sef[100001];
int boss(int x)
{
if(sef[x]==x)
return x;
else
return sef[x]=boss(sef[x]);
}
void unire(int x, int y)
{
sef[boss(y)]=boss(x);
}
int main()
{
int n,q;
in>>n>>q;
int a,x,y;
for(int i=1;i<=n;i++)
{
sef[i]=i;
}
for(int i=1;i<=q;i++)
{
in>>a>>x>>y;
if(a==1)
{
unire(x,y);
}
else
{
if(boss(x)==boss(y))out<<"DA"<<'\n';
else out<<"NU"<<'\n';
}
}
return 0;
}