Cod sursa(job #2200593)
| Utilizator | Data | 1 mai 2018 22:36:23 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int m, t[100002];
inline int tata(int x)
{
while(t[x]!=0)
x=t[x];
return x;
}
int main()
{
freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);
int op, x, y;
scanf("%d",&m);
scanf("%d",&m);
for(int i=0;i<m;i++)
{
scanf("%d",&op);
scanf("%d",&x);
scanf("%d",&y);
x=tata(x);
y=tata(y);
if(op==1)
t[x]=y;
else if(x==y)
printf("DA\n");
else
printf("NU\n");
}
return 0;
}
