Submission #420180

---

Source Code Expand

#include <stdio.h>

#define UNION_FIND_MAX 100000

int uf_table[UNION_FIND_MAX];

void uf_init(void) {
	int i;
	for(i=0;i<UNION_FIND_MAX;i++)uf_table[i]=0;
}

void uf_merge(int a,int b) {
	int next;
	while(uf_table[a]>0) {
		next=uf_table[a]-1;
		if(uf_table[next]>0)uf_table[a]=uf_table[next];
		a=next;
	}
	while(uf_table[b]>0) {
		next=uf_table[b]-1;
		if(uf_table[next]>0)uf_table[b]=uf_table[next];
		b=next;
	}
	if(a!=b)uf_table[a]=b+1;
}

int uf_issame(int a,int b) {
	int next;
	while(uf_table[a]>0) {
		next=uf_table[a]-1;
		if(uf_table[next]>0)uf_table[a]=uf_table[next];
		a=next;
	}
	while(uf_table[b]>0) {
		next=uf_table[b]-1;
		if(uf_table[next]>0)uf_table[b]=uf_table[next];
		b=next;
	}
	return a==b;
}

int main(void) {
	int asumi,mizuhasi;
	int kitaeri;
	if(scanf("%d%d",&asumi,&mizuhasi)!=2)return 1;
	uf_init();
	for(kitaeri=0;kitaeri<mizuhasi;kitaeri++) {
		int ayaneru,riesyon,mareitaso;
		if(scanf("%d%d%d",&ayaneru,&riesyon,&mareitaso)!=3)return 1;
		if(ayaneru==0) {
			uf_merge(riesyon,mareitaso);
		} else if(ayaneru==1) {
			puts(uf_issame(riesyon,mareitaso)?"Yes":"No");
		}
	}
	return 0;
}

Submission Info

Judge Result