Pagini recente » Cod sursa (job #3204588) | Cod sursa (job #2576117) | Cod sursa (job #1757877) | Cod sursa (job #2716113) | Cod sursa (job #2700988)
#include <fstream>
#define NMAX 100000
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int sef[NMAX+1];
int sef_suprem(int x){
if (sef[x]==x)
return x;
return sef[x]= sef_suprem(sef[x]);
}
void unire (int a, int b){
int sef_a, sef_b;
sef_a = sef_suprem(a);
sef_b = sef_suprem(b);
sef[sef_a] = sef_b;
}
int main()
{
int n,k,tip,x,y;
cin>>n>>k;
for (int i=1;i<=n;i++)
sef[i]=i;
for (int i=1;i<=k;i++)
{
cin>>tip>>x>>y;
if (tip==1)
unire (x,y);
else
{
if ( sef_suprem(x) == sef_suprem(y) )
cout<<"DA"<<'\n';
else
cout<<"NU"<<"\n";
}
}
return 0;
}