Pagini recente » Borderou de evaluare (job #1044306) | Cod sursa (job #2545069)
#include <fstream>
using namespace std;
#define N 1000005
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int P[N],S[N],n,m;
int Find(int nod)
{
if(P[nod]==nod)
return nod;
else
Find(P[nod]);
}
int Union(int x, int y)
{
int X=Find(x);
int Y=Find(y);
if(X>Y)
P[x]=Y;
else
P[y]=x;
}
int main()
{
int i,c,x,y;
cin>>n>>m;
for(i=1;i<=n;i++)
P[i]=i;
for(i=1; i<=m; i++)
{
cin>>c>>x>>y;
if(c==1)
Union(x,y);
else
{
if(Find(x)==Find(y))
cout<<"DA";
else
cout<<"NU";
cout<<'\n';
}
}
return 0;
}