Pagini recente » Cod sursa (job #1977319) | Cod sursa (job #2755213) | Cod sursa (job #140655) | Cod sursa (job #2984653) | Cod sursa (job #2701002)
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int sef[100001],n,m;
int sef_suprem(int x)
{
if(x==sef[x])
return x;
return sef[x]=sef_suprem(sef[x]);
}
void unire(int x,int y)
{
int a,b;
a=sef_suprem(x);
b=sef_suprem(y);
sef[a]=b;
}
int main()
{
int x,y,z;
in>>n>>m;
for(int i=1;i<=n;i++)
sef[i]=i;
for(int i=1;i<=m;i++)
{
in>>z>>x>>y;
if(z==1)
{
unire(x,y);
}
else
{
if(sef_suprem(x)==sef_suprem(y))
out<<"DA"<<'\n';
else
out<<"NU"<<'\n';
}
}
return 0;
}