Pagini recente » munte2 | Cod sursa (job #3334922) | Cod sursa (job #3316308) | Cod sursa (job #857323) | Cod sursa (job #3356353)
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,x,y,cer;
int t[100001];
int fnd(int x)
{
while(x!=t[x])
{
x=t[x];
}
return x;
}
void unite(int x,int y)
{
int tx=fnd(x);
int ty=fnd(y);
t[ty]=tx;
}
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
t[i]=i;
for(int i=1;i<=m;i++)
{
fin>>cer>>x>>y;
if(cer==1)
{
unite(x,y);
}
else if(cer==2)
{
if(fnd(x)!=fnd(y))
fout<<"NU"<<'\n';
else
fout<<"DA"<<'\n';
}
}
return 0;
}