} }elseif(c =='A') {if(same(x, y))printf("In the same gang.\n");elseif(same(x, opposite[y]))printf("In different gangs.\n");elseprintf("Not sure yet.\n"); } }intmain(){ freopen("in.txt","r",stdin);scanf("%d", &t);while(t--) {scanf("%d%d", &n, &m); i...
1#include<iostream>2#include<algorithm>3#include<cstdio>4usingnamespacestd;5constintmaxn =100007;6intt,n,m,fa[maxn],c[maxn];7intfi(intx)8{9if(fa[x]==x)returnx;10intt =fa[x];11fa[x]=fi(fa[x]);12c[x]=(c[x]+c[t])%2;13returnfa[x];14}15voidmake(chars,intx,inty)...
#include<iostream> #include<cstdio> #include<cstdlib> #include<cstring> usingnamespacestd; #definemaxn 100005 intn, m; intf[maxn], father[maxn]; intgetanc(inta) { if(a==father[a]) returna; returnfather[a]=getanc(father[a]); } voidmerge(inta,intb) { father[getanc(a)]=getanc...
#include<iostream>#include<cstring>#include<cstdio>#include<algorithm>usingnamespacestd;constintmaxn=1e5+5;ints[maxn];//父节点intr[maxn];//当前节点和父节点的关系voidclear_set(){for(inti=0;i<maxn;i++){s[i]=i;}memset(r,0,sizeof(r));//最开始自己和自己同性}intfind_set(intx){i...