Pagini recente » Cod sursa (job #749377) | Cod sursa (job #2788967) | Cod sursa (job #2866526) | Cod sursa (job #369027) | Cod sursa (job #2083596)
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int rg[100002];
int t[100002];
int rad(int x)
{
int r,y;
r=x;
while(r!=t[r])
r=t[r];
while(x!=t[x])
{
y=t[x];
t[x]=r;
x=t[x];
}
return r;
}
void unire(int a,int b)
{
if(rg[a]>rg[b])
t[b]=t[a];
else
t[a]=t[b];
if(rg[a]==rg[b])
rg[b]++;
}
int main()
{
int n,x,y,c,m;
fin>>n>>m;
for(int i=1;i<=n;i++)
{
t[i]=i;
rg[i]=1;
}
for(int i=1;i<=m;i++)
{
fin>>c>>x>>y;
int rx=rad(x);
int ry=rad(y);
if(c==1)
{
unire(rx,ry);
}
else
{
if(rx==ry)
{
fout<<"DA\n";
}
else
fout<<"NU\n";
}
}
return 0;
}