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 ) N, M (N<=1000, M<=10000) N,M(N<=1000,M<=10000) is represent the number of watchtower and the number of wall. The watchtower numbered from 0 0 0 to N − 1 N-1 N−1. Next following M lines, every line contain two integers A , B A, B A,B mean between A A A and B B B has a wall( A A A and B B 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 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;
int f[1010];
int n,m;
int getf(int v)
{
if(f[v]==v)
return v;
return f[v]=getf(f[v]);
}
int merge(int u,int v)
{
int t1=getf(u);
int t2=getf(v);
if(t1!=t2)
{
f[t2]=t1;
return 0;
}
return 1;
}
void init()
{
for(int i=0;i<=n;i++)
f[i]=i;
}
int main()
{
while(cin>>n>>m)
{
int a,b,sum=0;
init();
for(int i=0;i<m;i++)
{
cin>>a>>b;
sum+=merge(a,b);
}
cout<<sum<<endl;
}
return 0;
}
实 践 是 检 验 真 理 的 唯 一 标 准 {\color{DarkBlue} 实践是检验真理的唯一标准} 实践是检验真理的唯一标准