HDOJ并查集题目 HDOJ 1213 HDOJ 1242

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

 

并查集水题，完全不用用到并查集的优化算法，父亲节点若为本身，则自开一桌；

 

附AC代码：

 1 #include<stdio.h>
 2 #include<stdlib.h>
 3 typedef struct node *ufs;
 4 struct node
 5 {
 6     int parent[1001];
 7 }; 
 8 int find(int e,ufs U)
 9 {
10     while(U->parent[e]!=e)
11     {
12         e=U->parent[e];
13     }
14     return e;
15 }
16 void ufunion(int i,int j,ufs u)
17 {
18     u->parent[j]=i;
19 }
20 int main()
21 {
22     ufs u;
23     u=(ufs)malloc(sizeof(node));
24     int n,m,i,t,a,b;
25     scanf("%d",&t);
26     while(t--)
27     {
28         scanf("%d %d",&n,&m);
29         for(i=1;i<=n;i++)
30         {
31             u->parent[i]=i;
32         }
33         while(m--)
34         {
35             scanf("%d %d",&a,&b);
36             int t1=find(a,u),t2=find(b,u);
37             if(t1!=t2)
38             {
39                 ufunion(t1,t2,u);
40             }
41         }
42         int ans=0;
43         for(i=1;i<=n;i++)
44         {
45             if(u->parent[i]==i)//父亲节点是他本身，则多开一张桌子
46                 ans++;
47         }
48         printf("%d\n",ans);
49     }
50     return 0;
51 }

View Code

 

 HDOJ 1232类似上题

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

 

附AC代码：

 1 #include<stdio.h>
 2 #include<stdlib.h>
 3 typedef struct node *ufs;
 4 struct node
 5 {
 6     int parent[1001];
 7 }; 
 8 int find(int e,ufs U)
 9 {
10     while(U->parent[e]!=e)
11     {
12         e=U->parent[e];
13     }
14     return e;
15 }
16 void ufunion(int i,int j,ufs u)
17 {
18     u->parent[j]=i;
19 }
20 int main()
21 {
22     ufs u;
23     u=(ufs)malloc(sizeof(node));
24     int n,m,i,t,a,b;
25     while(scanf("%d",&n)!=EOF&&n!=0)
26     {
27         scanf("%d",&m);
28         for(i=1;i<=n;i++)
29         {
30             u->parent[i]=i;
31         }
32         while(m--)
33         {
34             scanf("%d %d",&a,&b);
35             int t1=find(a,u),t2=find(b,u);
36             if(t1!=t2)
37             {
38                 ufunion(t1,t2,u);
39             }
40         }
41         int ans=0;
42         for(i=1;i<=n;i++)
43         {
44             if(u->parent[i]==i)//父亲节点是他本身，则多开一张桌子
45                 ans++;
46         }
47         printf("%d\n",ans-1);
48     }
49     return 0;
50 }

View Code

 

 

转载于:https://www.cnblogs.com/zeze/p/HDOJ12131232.html