Pagini recente » Cod sursa (job #2231976) | Cod sursa (job #986160) | Cod sursa (job #2739349) | Cod sursa (job #1099923) | Cod sursa (job #2115782)
#include <iostream>
#include <cstdio>
#define N 100005
using namespace std;
int t[N];
int x, y, op, n, m;
void adaug(int x, int y)
{
if(t[x]!=t[y])
{
int r1=t[x], r2=t[y], nr1=0, nr2=0;
while(r1!=t[r1])
r1=t[r1], nr1++;
while(r2!=t[r2])
r2=t[r2], nr2++;
if(nr1<nr2)
t[r1]=r2;
else
t[r2]=r1;
}
}
int multime(int x, int y)
{
int r1=t[x], r2=t[y];
while(r1!=t[r1])
r1=t[r1];
while(r2!=t[r2])
r2=t[r2];
return (r1==r2);
}
int main()
{
freopen("disjoint.in", "r", stdin);
freopen("disjoint.out", "w", stdout);
scanf("%d %d\n", &n, &m);
for(int i=1;i<=n;i++)
t[i]=i;
for(int i=0;i<m;i++)
{
scanf("%d %d %d\n", &op, &x, &y);
if(op==1)
adaug(x, y);
else
if(multime(x, y))
printf("DA\n");
else
printf("NU\n");
}
return 0;
}