Pagini recente » Cod sursa (job #139195) | Cod sursa (job #862636) | Cod sursa (job #1739300) | Cod sursa (job #1015690) | Cod sursa (job #1146062)
#include<fstream>
#define DMAX 100003
using namespace std;
ifstream fin ("disjoint.in");
ofstream fout("disjoint.out");
int n,m,q,x,y,i,dad[DMAX];
int caut(int x)
{
int r=x,y;
while(r!=dad[r])
r=dad[r];
while(x!=dad[x])
{
y=dad[x];
dad[x]=r;
x=y;
}
return r;
}
int main()
{
fin>>n>>m;
for(i=1;i<=n;++i)
dad[i]=i;
for(i=0;i<m;++i)
{
fin>>q>>x>>y;
if(q==2)
{
if(caut(x)==caut(y))
fout<<"DA"<<'\n';
else
fout<<"NU"<<'\n';
}
else
dad[caut(x)]=caut(y);
}
return 0;
}