开封市住房和城乡建设网站,东莞常平粤海水务,新开网店怎么推广,代理网络游戏服务平台题意#xff1a;问给出的望塔之间的建造了围墙#xff0c;将土地分成了几份
思路#xff1a;用并查集判环#xff0c;若有围墙相接的瞭望塔#xff0c;有相同的父根#xff0c;则存在环
ice_creams world is a rich country, it has many fertile lands. Today, the qu…题意问给出的望塔之间的建造了围墙将土地分成了几份
思路用并查集判环若有围墙相接的瞭望塔有相同的父根则存在环
ice_creams 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 (N1000, M10000) 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 10
0 1
1 2
1 3
2 4
3 4
0 5
5 6
6 7
3 6
4 7
Sample Output
3
#includeiostream
#includestring.h
using namespace std;
int m,n,dp[1010];
int f(int xx)
{if(xxdp[xx])return xx;elsereturn f(dp[xx]);
}
int dfs(int x,int y)
{int af(x);int bf(y);if(a!b){dp[b]a;return 0;}elsereturn 1;
}
int main()
{while(cinmn){int sum0;for(int i0; im; i)dp[i]i;while(n--){int t1,t2;cint1t2;sumdfs(t1,t2);}coutsumendl;}return 0;
}
