Pagini recente » Cod sursa (job #3256711) | Cod sursa (job #565635) | Cod sursa (job #732745) | Cod sursa (job #278061) | Cod sursa (job #2050706)
#include<stdio.h>
using namespace std;
#define MAXN 100001
int dad[MAXN];
int find_daddy(int x){
if(x==dad[x])
return x;
return dad[x]=find_daddy(dad[x]);
}
inline void join(int x, int y){
int rx, ry;
rx=find_daddy(x);
ry=find_daddy(y);
dad[ry]=rx;
}
int main(){
FILE*fin=fopen("disjoint.in", "r");
FILE*fout=fopen("disjoint.out", "w");
int n, i, tip, x, y, m, a, b;
fscanf(fin, "%d%d", &n, &m);
for(i=1; i<=n; i++)
dad[i]=i;
for(i=1; i<=m; i++){
fscanf(fin, "%d%d%d", &tip, &x, &y);
if(tip==1)
join(x, y);
else{
a=find_daddy(x);
b=find_daddy(y);
if(a==b)
fprintf(fout, "DA\n");
else
fprintf(fout, "NU\n");
}
}
return 0;
}