并查集1.0(找集合个数 hdu 1232 1213)

原创 2017年01月04日 07:44:07

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;
}
版权声明:本文为博主原创文章,未经博主允许不得转载

相关文章推荐

并查集+hdu(1232 and 1213)

由于杭电1213题和1232基本一致,所以以

HDU 1232 & 1213并查集应用 练习

并查集还是挺简单的,路径压缩,按秩合并(这个很麻烦,建议了解就好,主要是路径压缩,我写的代码也只是普通的合并); 前天学的,要练练手,以防生疏; http://acm.hdu.edu.cn/sho...

HDU-畅通工程-1232(并查集)How Many Tables(1213)

/*畅通工程 Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Sub...

并查集 Hdu 1272 (判环)+ Hdu 1213 + Hdu 1232 + Hdu 3172

Hdu 1272 小希的迷宫 思路:两点的根节点相同,并且他们又彼此连通,则说明构成环。如果无环且 点数-1==边数 则说明只有一个连通块 #include #include const i...

HDU1213 How Many Tables(并查集)

How Many Tables Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)...

HDU 1213 How Many Tables? (简单并查集)

How Many Tables Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...

ACM-并查集- How Many Tables-HDU - 1213

D - How Many Tables Today is Ignatius' birthday. He invites a lot of friends. Now it's dinner t...

hdu 1213 How Many Tables 并查集

Today is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to kn...

HDU- -1213 How Many Tables(水+并查集)

点击打开题目链接 How Many Tables Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Ja...

HDU1213-How Many Tables 并查集

HDU1213-How Many Tables,并查集算法,算出根的个数就是答案了
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:并查集1.0(找集合个数 hdu 1232 1213)
举报原因:
原因补充:

(最多只允许输入30个字)