HUEL_ACM第二学期第二周：扩展域并查集

A

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
const int N=1e6+5;
int n,m;
int p[N];
int sum[N];
int find(int x){
	if(p[x]!=x)return p[x]=find(p[x]);
	return p[x];
}
int main(){
	while(scanf("%d%d",&n,&m),n||m){
		for(int i=0;i<n;i++)p[i]=i,sum[i]=1;
		
		while(m--){
			int nums,a,b;
			scanf("%d",&nums);
			scanf("%d",&a);
			for(int i=0;i<nums-1;i++){
				scanf("%d",&b);
				int aa=find(a),bb=find(b);
				if(p[aa]!=p[bb]){
					p[aa]=bb;
					sum[bb]+=sum[aa];
				}
			} 
		}
		
		int root=find(0);
		printf("%d\n",sum[root]);
	}
}

B

#include <iostream>
#include <cstring>
using namespace std;
const int N=1e6+5;
int n,m;
int p[N];

int find(int x){
	if(x!=p[x]) p[x]=find(p[x]);
	return p[x];
}

int main(){
	cin>>n>>m;
	
	int ans=0;
	
	for(int i=1;i<=n*3;i++)p[i]=i;
	while(m--){
		int type,a,b;
		scanf("%d%d%d",&type,&a,&b);
		
		if((a==b&&type==2)||a>n||b>n){
		    ans++;
		    continue;
		}
		if(type==1){
			if(find(a+n)==find(b)||find(a)==find(b+n)){
				ans++;
				continue;
			}
			p[find(a)]=find(b);
			p[find(a+n)]=find(b+n);
			p[find(a+2*n)]=find(b+2*n);
		}
		else{
			if(find(a)==find(b)||find(a+n)==find(b)){
				ans++;
				continue;
			}
			p[find(a)]=find(b+n);
			p[find(a+n)]=find(b+2*n);
			p[find(a+2*n)]=find(b);
		}
	}
	
	printf("%d\n",ans);
} 

C

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
const int N=1e6+5;
int n,m;
int p[N];
int find(int x){
	if(p[x]!=x) p[x]=find(p[x]);
	return p[x];
}
int main(){
	int T;
	scanf("%d",&T);
	for(int i=1;i<=T;i++){
		
	     scanf("%d%d",&n,&m);
	     for(int i=1;i<=n*2;i++)p[i]=i;
	     
	     bool flag=true;
	     while(m--){
	     	int a,b;
	     	cin>>a>>b;
	     	if(find(a+n)==find(b+n)||find(a)==find(b)){
	     		//cout<<a<<"***"<<b<<"**"<<find(a+n)<<"***"<<find(b+n)<<endl;
	     		//cout<<find(a)<<"***"<<find(b)<<endl;
	     		flag=false;
			 }
			p[find(a+n)]=find(b);
			p[find(a)]=find(b+n); 
		 }
		 
		 printf("Scenario #%d:\n",i);
		 if(!flag)puts("Suspicious bugs found!");
		 else puts("No suspicious bugs found!"); 
		 printf("\n");
	}
}

D

#include <iostream>
#include <cstring>
#include <cstdio>
#include <map>
#include <algorithm>
using namespace std;
const int N=40010,base=N/2;
int n,m;
int p[N];
map<int,int>S;
int idx;
int find(int x){
	if(p[x]!=x) p[x]=find(p[x]);
	return p[x];
}
int get(int x){
	if(!S.count(x))S[x]=idx++;
	return S[x];
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i=0;i<N;i++)p[i]=i;
	int res=m;
	for(int i=1;i<=m;i++){
		int x,y;
		string type;
		//scanf("%d%d%s",&x,&y,type);
		cin>>x>>y>>type;
		int a=get(x-1),b=get(y);
		
		if(type=="even"){
			if(find(a+base)==find(b)||find(a)==find(b+base)){
				res=i-1;
				break;
			}
			p[find(a)]=find(b);
			p[find(a+base)]=find(b+base);
		}
		else{
			if(find(a)==find(b)||find(a+base)==find(b+base)){
				res=i-1;
				break;
			}
			p[find(a+base)]=find(b);
			p[find(a)]=find(b+base);
		} 
	}
	printf("%d",res); 
}