Pagini recente » Cod sursa (job #2069805) | Cod sursa (job #2950852) | Cod sursa (job #52016) | Cod sursa (job #721944) | Cod sursa (job #276852)
Cod sursa(job #276852)
#include<fstream.h>
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int *t,*rg,n,m,i,o;
int rad(int nod)
{
int y;
int x;
x=nod;
while(t[nod]!=nod)
{
nod=t[nod];
}
while(t[x]!=x)
{
y=t[x];
t[x]=nod;
x=y;
}
return nod;
}
int main(void)
{
int x,y;
in>>n>>m;
t=new int[n+21];
rg=new int[n+21];
for(i=1;i<=n;i++)
{
t[i]=i;
rg[i]=1;
}
for(i=1;i<=m;i++)
{
in>>o>>x>>y;
if(o==1)
{
if(rg[x]>rg[y])
{
t[y]=x;
}
else
{
t[x]=y;
}
if(rg[x]==rg[y]) rg[y]++;
}
else
{
if(rad(x)==rad(y)) out<<"DA \n";
else out<<"NU \n";
}
}
in.close();
out.close();
delete t;
delete rg;
return 0;
}