Pagini recente » Cod sursa (job #307929) | Istoria paginii runda/lh.11-1/clasament | Monitorul de evaluare | Cod sursa (job #1181943) | Cod sursa (job #2715944)
#include <fstream>
#define NMAX 100000
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int sef[NMAX+1];
void sef_suprem(int nod)
{
if (sef[nod] == nod)
return nod;
return sef[nod] = sef_suprem(sef[nod]);
}
void unire (int a, int b)
{
int sef_a = sef_suprem(a);
int 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;
}