Pagini recente » Cod sursa (job #2352835) | Cod sursa (job #2408859) | Cod sursa (job #805724) | Cod sursa (job #2408852) | Cod sursa (job #2420907)
#include<cstdio>
#define M 6000000
#define N 100001
int n,m,y,z,p[N],o=-1,l;
char r[M];
inline int A()
{
int s=0;
for(o++;r[o]>47;o++)
s=s*10+r[o]-48;
return s;
}
int main()
{
freopen("disjoint.in","r",stdin),freopen("disjoint.out","w",stdout),fread(r,1,M,stdin),n=A(),m=A();
while(m--)
{
for(n=A(),y=A(),z=A();p[y];y=p[y]);
for(;p[z];z=p[z]);
if(n==2)
if(y==z)
r[l++]=68,r[l++]=65,r[l++]=10;
else
r[l++]=78,r[l++]=85,r[l++]=10;
else
p[z]=y;
}
fwrite(r,1,l,stdout);
}