Cod sursa(job #2302669)
Utilizator | Data | 14 decembrie 2018 23:17:16 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 100 |
Compilator | c-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<stdio.h>
int n,m,y,z,p[100001];
int main()
{
freopen("disjoint.in","r",stdin),freopen("disjoint.out","w",stdout),scanf("%d%d",&n,&m);
while(m--)
{
scanf("%d%d%d",&n,&y,&z);
for(;p[y];y=p[y]);
for(;p[z];z=p[z]);
if(n==2)
printf("%s\n",y==z?"DA":"NU");
else
p[z]=y;
}
}