Pagini recente » Cod sursa (job #1339228) | Cod sursa (job #2620233) | Cod sursa (job #2498963) | Cod sursa (job #3132631) | Cod sursa (job #1333711)
#include <iostream>
#include <cstdio>
#include <algorithm>
#define NMAX 100005
using namespace std;
int n, m;
int a[NMAX];
char rasp[][3]={"NU", "DA"};
void unire(int x, int y)
{
for (int i=1; i<=n; i++)
if (a[i] == y)
a[i] = x;
}
int main()
{
freopen("disjoint.in", "r", stdin);
freopen("disjoint.out", "w", stdout);
int o, x, y;
scanf("%d %d\n", &n, &m);
for (int i=1; i<=n; i++)
a[i] = i;
for (int i=0; i<m; i++){
scanf("%d %d %d\n", &o, &x, &y);
if (o==2){
printf("%s\n", rasp[a[x]==a[y]]);
}
else{
unire(x, y);
}
}
return 0;
}