Pagini recente » Cod sursa (job #2601436) | Cod sursa (job #1746953) | Cod sursa (job #1343398) | Cod sursa (job #920190) | Cod sursa (job #1344954)
#include <iostream>
#include <fstream>
#define maxim 100001
using namespace std;
int n,m;
int p[maxim];
void solve_1(int x,int y)
{
p[y]=x;
}
void solve_2(int x,int y)
{
int aux=y;
while(p[aux]!=0)
{
aux=p[aux];
}
int auxx=x;
while(p[auxx]!=0)
{
auxx=p[auxx];
}
if(aux==auxx)
printf("DA\n");
else printf("NU\n");
}
int main()
{
freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);
scanf("%d %d",&n,&m);
int tip,x,y;
for(int i=1;i<=m;i++)
{scanf("%d %d %d",&tip,&x,&y);
if(tip==1)
solve_1(x,y);
else solve_2(x,y);}
return 0;
}