Pagini recente » Cod sursa (job #749575) | Cod sursa (job #2622546) | Cod sursa (job #1094185) | Cod sursa (job #2481135) | Cod sursa (job #726647)
Cod sursa(job #726647)
#include<stdio.h>
#define nmax 100005
int n,m,t[nmax],h[nmax];
int find(int x){
int r,y;
r=x;
while(t[r]!=0)//gasim radacina arborelui
r=t[r];
while(t[x]!=0){//realizam compresia
y=t[x];
t[x]=r;
x=y;
}
return r;
}
void unite(int x,int y){
if(h[x]>h[y])
t[y]=x;
else
t[x]=y;
if(h[x]==h[y])//h[x]==h[y] => t[x]=y
h[y]++;
}
int main(){
FILE *f,*g;
int a,b,c,i;
f=fopen("disjoint.in","r");
g=fopen("disjoint.out","w");
fscanf(f,"%d%d",&n,&m);
for(i=1;i<=n;i++){
t[i]=0;
h[i]=1;
}
for(i=1;i<=m;i++){
fscanf(f,"%d%d%d",&c,&a,&b);
if(c==2)
if(find(a)==find(b))
fprintf(g,"DA\n");
else
fprintf(g,"NU\n");
else
unite(find(a),find(b));
}
fclose(f);
fclose(g);
return 0;
}