Pagini recente » Cod sursa (job #921627) | Cod sursa (job #767954) | Cod sursa (job #2643366) | Cod sursa (job #2679251) | Cod sursa (job #1409524)
#include<fstream>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int N,M,i,j,parinte[100001],x,k,y;
int main()
{
cin>>M>>N;
for(i=1;i<=M;i++)
parinte[i]=-1;
for(i=1;i<=N;i++)
{
cin>>k>>x>>y;
while(x[parinte]>0)
x=x[parinte];
while(y[parinte]>0)
y=y[parinte];
if(k==1)
{
if(x!=y)
{
if(x[parinte]>y[parinte])
{
y[parinte]+=x[parinte];
x[parinte]=y;
}
else
{
x[parinte]+=y[parinte];
y[parinte]=x;
}
}
}
else
{
if(x==y)
cout<<"DA"<<'\n';
else
cout<<"NU"<<'\n';
}
}
return 0;
}