大一积分赛 (一)——Ice_cream's world I【并查集判环】

最新推荐文章于 2024-06-05 07:30:00 发布

gx翔鸽

最新推荐文章于 2024-06-05 07:30:00 发布

阅读量134

点赞数

分类专栏：并查集文章标签：并查集判环

本文链接：https://blog.csdn.net/xiang_hehe/article/details/79810326

版权

并查集专栏收录该内容

9 篇文章 0 订阅

订阅专栏

Ice_cream's world I

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1905 Accepted Submission(s): 1100

Problem Description

ice_cream's world is a rich country, it has many fertile lands. Today, the queen of ice_cream wants award land to diligent ACMers. So there are some watchtowers are set up, and wall between watchtowers be build, in order to partition the ice_cream’s world. But how many ACMers at most can be awarded by the queen is a big problem. One wall-surrounded land must be given to only one ACMer and no walls are crossed, if you can help the queen solve this problem, you will be get a land.

Input

In the case, first two integers N, M (N<=1000, M<=10000) is represent the number of watchtower and the number of wall. The watchtower numbered from 0 to N-1. Next following M lines, every line contain two integers A, B mean between A and B has a wall(A and B are distinct). Terminate by end of file.

Output

Output the maximum number of ACMers who will be awarded.
One answer one line.

Sample Input

   8 10 0 1 1 2 1 3 2 4 3 4 0 5 5 6 6 7 3 6 4 7 
 

Sample Output

解题思路：当合并两个新的元素时，如果两个元素同根，那么合并后必成一个环

#include<algorithm>
#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
const int MAX_N=100010;
int rank[MAX_N],par[MAX_N],a[MAX_N],b[MAX_N];
void init(int n){
	for(int i=0;i<n;i++){
		par[i]=i;
	}
}
int find(int x){
	int r=x;
	while(par[r]!=r) r=par[r];
	int i=x,j;
	while(i!=r){
		j=par[i];
		par[i]=r;
		i=j;
	}
	return r;
}
int join(int x,int y){
	int fx=find(x),fy=find(y);
	if(fx==fy) return 1;//如果两个元素属于同一集合则返回值为一
	par[fx]=fy;
	return 0;
}
int main(){
	int n,m;
	while(~scanf("%d%d",&n,&m)){
		int ans=0;
		init(n);
		for(int i=0;i<m;i++){
			scanf("%d %d",&a[i],&b[i]);
			ans=ans+join(a[i],b[i]);
		}
		printf("%d\n",ans); 
	}
	return 0;
}