Ice_cream's world I
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 569 Accepted Submission(s): 322
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.
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
3
并查集判断环的个数。
#include <iostream>
using namespace std;
const int Max=10010;
int father[Max];
int sum[Max];
int Size[Max];
int Find(int x)
{
while (x!=father[x])
{
x=father[x];
}
return x;
}
int main()
{
int N,M;
int ans;
while (scanf("%d%d",&N,&M)!=EOF)
{
ans=0;
int a;
int b;
for (int i=0; i<N; i++)
{
father[i]=i;
Size[i]=i;
}
for (int i=1; i<=M; i++)
{
scanf("%d%d",&a,&b);
int fx=Find(a);
int fy=Find(b);
if(fx!=fy)
{
if(Size[fx]>Size[fy])
{
father[fy]=fx;
Size[fx]+=Size[fy];
}
else
{
father[fx]=fy;
Size[fy]+=Size[fx];
}
}
else
{
ans++;
}
}
cout<<ans<<endl;
}
return 0;
}