HDU 2120 Ice_cream's world I

Ice_cream's world I

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

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 100 11 21 32 43 40 55 66 73 64 7

 

Sample Output

3

 

Author

Wiskey

 

Source

HDU 2007-10 Programming Contest_WarmUp

 

Recommend

威士忌   |   We have carefully selected several similar problems for you:  2122 2118 2119 2121 2117 

好久没写并查集了，写道题练练手，这道题主要是判断有多少个环

#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int pre[1100],ans;int find(int x){if(x==pre[x])return x;return pre[x]=find(pre[x]);}void merge(int x,int y){int fx=find(x);int fy=find(y);if(fx!=fy)pre[fx]=fy;elseans++;}int main(){int n,m,a,b,i;while(scanf("%d%d",&n,&m)!=EOF){ans=0;for(i=0;i<=n;i++)pre[i]=i;for(i=0;i<m;i++){scanf("%d%d",&a,&b);merge(a,b);}printf("%d\n",ans);}return 0;}