并查集1.0(找集合个数 hdu 1232 1213)
来源:互联网 发布:chakra linux 怎么样 编辑:程序博客网 时间:2024/05/29 01:55
hdu1232畅通工程
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 49430 Accepted Submission(s): 26379
Problem Description
某省调查城镇交通状况,得到现有城镇道路统计表,表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交通(但不一定有直接的道路相连,只要互相间接通过道路可达即可)。问最少还需要建设多少条道路?
Input
测试输入包含若干测试用例。每个测试用例的第1行给出两个正整数,分别是城镇数目N ( < 1000 )和道路数目M;随后的M行对应M条道路,每行给出一对正整数,分别是该条道路直接连通的两个城镇的编号。为简单起见,城镇从1到N编号。
注意:两个城市之间可以有多条道路相通,也就是说
3 3
1 2
1 2
2 1
这种输入也是合法的
当N为0时,输入结束,该用例不被处理。
Output
对每个测试用例,在1行里输出最少还需要建设的道路数目。
Sample Input
4 2
1 3
4 3
3 3
1 2
1 3
2 3
5 2
1 2
3 5
999 0
0
Sample Output
1
0
2
998
/************************************************************************* > File Name: hdu1232.cpp > Author:ukiy > Mail: > Created Time: 2017年01月04日 星期三 06时24分54秒 ************************************************************************/#include<iostream>#include<cstdio>#include<algorithm>#include<cmath>#include<cstdlib>#include<climits>#include<string>#include<cstring>#include<vector>#include<set>#include<list>#include<map>#include<queue>#define rep(i,a,b) for(int i=(a);i<=(b);(i++))#define inf 0x3f3f3f#define ll long long#define pi acos(-1)int dire[4][2]={ {0,1},{1,0},{0,-1},{-1,0} };int dire2[8][2]={{-1,-1},{-1,0},{-1,1},{ 0,-1},{ 0,1},{ 1,-1},{ 1,0},{ 1,1}};int dire3[6][3]={ {0,0,1},{0,1,0},{1,0,0},{0,0,-1},{0,-1,0},{-1,0,0} };using namespace std;int n,m;int tot;int pre[1005];void init(){ rep(i,0,n){ pre[i]=i; }}int find(int x){ int r=x; while(pre[r]!=r){ r=pre[r]; } int i=x; while(i!=r){ int t=pre[i]; pre[i]=r; i=t; } return r;}void join(int x,int y){ int fx=find(x),fy=find(y); if(fx!=fy){ pre[fx]=fy; tot--; }}int main(){ std::ios::sync_with_stdio(false); //freopen("in.txt","r",stdin); while(cin>>n>>m){ if(n==0) break; init(); tot=n-1; rep(i,1,m){ int x,y; cin>>x>>y; join(x,y); } cout<<tot<<endl; } return 0;}
hdu1213 How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 26536 Accepted Submission(s): 13199
Problem Description
Today is Ignatius’ birthday. He invites a lot of friends. Now it’s dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the friends know each other, and all the friends do not want to stay with strangers.
One important rule for this problem is that if I tell you A knows B, and B knows C, that means A, B, C know each other, so they can stay in one table.
For example: If I tell you A knows B, B knows C, and D knows E, so A, B, C can stay in one table, and D, E have to stay in the other one. So Ignatius needs 2 tables at least.
Input
The input starts with an integer T(1<=T<=25) which indicate the number of test cases. Then T test cases follow. Each test case starts with two integers N and M(1<=N,M<=1000). N indicates the number of friends, the friends are marked from 1 to N. Then M lines follow. Each line consists of two integers A and B(A!=B), that means friend A and friend B know each other. There will be a blank line between two cases.
Output
For each test case, just output how many tables Ignatius needs at least. Do NOT print any blanks.
Sample Input
2
5 3
1 2
2 3
4 5
5 1
2 5
Sample Output
2
4
/************************************************************************* > File Name: hdu1213.cpp > Author:ukiy > Mail: > Created Time: 2017年01月04日 星期三 07时09分57秒 ************************************************************************/#include<iostream>#include<cstdio>#include<algorithm>#include<cmath>#include<cstdlib>#include<climits>#include<string>#include<cstring>#include<vector>#include<set>#include<list>#include<map>#include<queue>#define rep(i,a,b) for(int i=(a);i<=(b);(i++))#define inf 0x3f3f3f#define ll long long#define pi acos(-1)int dire[4][2]={ {0,1},{1,0},{0,-1},{-1,0} };int dire2[8][2]={{-1,-1},{-1,0},{-1,1},{ 0,-1},{ 0,1},{ 1,-1},{ 1,0},{ 1,1}};int dire3[6][3]={ {0,0,1},{0,1,0},{1,0,0},{0,0,-1},{0,-1,0},{-1,0,0} };using namespace std;int n,m;int tot;int pre[1005];void init(){ rep(i,0,n){ pre[i]=i; }}int find(int x){ int r=x; while(r!=pre[r]){ r=pre[r]; } int i=x; while(i!=r){ int t=pre[i]; pre[i]=r; i=t; } return r;}void join(int x,int y){ int fx=find(x),fy=find(y); if(fx!=fy){ pre[fx]=fy; tot--; }}int main(){ std::ios::sync_with_stdio(false); //freopen("in.txt","r",stdin); int T; cin>>T; while(T--){ cin>>n>>m; init(); tot=n; rep(i,1,m){ int x,y; cin>>x>>y; join(x,y); } cout<<tot<<endl; } return 0;}
- 并查集1.0(找集合个数 hdu 1232 1213)
- hdu 1232 / 1213 并查集(求子集个数)
- HDU 1213 How Many Tables(并查集统计求不同集合个数)
- hdu 1232 并查集 求连通分量的个数
- 并查集 删除节点 求集合的个数<set> hdu 2473
- HDU 1856 More is better(并查集判断集合元素个数)
- 并查集+hdu(1232 and 1213)
- 并查集--找亲戚
- C++ 并查集模板:找矩阵中'0'区域的个数
- More is better(找并查集最大中元素个数)
- hdu 1213 并查集
- hdu 1213 并查集
- hdu 1213并查集
- HDU-1213并查集
- hdu 1213 并查集
- HDU 1213 并查集
- hdu 1213 并查集
- HDU 1213 并查集
- 【网络流24题】方格取数问题
- 80老翁谈人生(307):老翁的悲哀无处诉说
- [13]CSS3 前缀和rem
- 新手入门:Spring的一些学习方法及意见
- poj 1755 Triathlon (半平面交求解不等式组)
- 并查集1.0(找集合个数 hdu 1232 1213)
- 关于高斯滤波的一些理解
- 8. String to Integer (atoi) 对于输入情况的考察
- Ubuntu的LAMP与相关软件安装设置
- 软件架构(CS结构/BS结构)
- 最小生成树1.0(hdu1233 还是畅通工程)
- android studio linux 环境下网络设置
- 基础6
- 用wampserver搭建HTTP服务(Apache)