CodeForces 659E New Reform (图的遍历判环)
2017-08-02 15:49
435 查看
Description
Berland has n cities connected by
m bidirectional roads. No road connects a city to itself, and each pair of cities is connected by no more than one road. It isnot guaranteed that you can get from any city to any other one, using only the
existing roads.
The President of Berland decided to make changes to the road system and instructed the Ministry of Transport to make this reform. Now, each road should be unidirectional (only lead from one city to another).
In order not to cause great resentment among residents, the reform needs to be conducted so that there can be as few separate cities as possible. A city is consideredseparate, if no road leads into it, while it is allowed
to have roads leading from this city.
Help the Ministry of Transport to find the minimum possible number of separate cities after the reform.
Input
The first line of the input contains two positive integers,
n and m — the number of the cities and the number of roads in Berland (2 ≤ n ≤ 100 000,1 ≤ m ≤ 100 000).
Next m lines contain the descriptions of the roads: thei-th road is determined by two distinct integersxi, yi
(1 ≤ xi, yi ≤ n,xi ≠ yi),
wherexi andyi are the numbers of the cities connected by thei-th
road.
It is guaranteed that there is no more than one road between each pair of cities, but it is not guaranteed that from any city you can get to any other one, using only roads.
Output
Print a single integer — the minimum number of separated cities after the reform.
Sample Input
Input
Output
Input
Output
Input
Output
Hint
In the first sample the following road orientation is allowed:
,
,
.
The second sample:
,
,
,
,
.
The third sample:
,
,
,
,
.
题意:给出一些点和边。要求你把边变成有向边使得入度为0的点最少
分析:对于一些相连的点来说,假设形成的图中有环。那么我们一定可以从环上的某点出发使入度为0的点没有,
假设无环,那么仅仅须要一个入度为0的点就能使其它点入度不为0,那么问题就转换为推断图中是否有环了,
我们从任一个点遍历整个图,然后判环调整答案就可以
Berland has n cities connected by
m bidirectional roads. No road connects a city to itself, and each pair of cities is connected by no more than one road. It isnot guaranteed that you can get from any city to any other one, using only the
existing roads.
The President of Berland decided to make changes to the road system and instructed the Ministry of Transport to make this reform. Now, each road should be unidirectional (only lead from one city to another).
In order not to cause great resentment among residents, the reform needs to be conducted so that there can be as few separate cities as possible. A city is consideredseparate, if no road leads into it, while it is allowed
to have roads leading from this city.
Help the Ministry of Transport to find the minimum possible number of separate cities after the reform.
Input
The first line of the input contains two positive integers,
n and m — the number of the cities and the number of roads in Berland (2 ≤ n ≤ 100 000,1 ≤ m ≤ 100 000).
Next m lines contain the descriptions of the roads: thei-th road is determined by two distinct integersxi, yi
(1 ≤ xi, yi ≤ n,xi ≠ yi),
wherexi andyi are the numbers of the cities connected by thei-th
road.
It is guaranteed that there is no more than one road between each pair of cities, but it is not guaranteed that from any city you can get to any other one, using only roads.
Output
Print a single integer — the minimum number of separated cities after the reform.
Sample Input
Input
4 3 2 1 1 3 4 3
Output
1
Input
5 5
2 11 3
2 3
2 5
4 3
Output
0
Input
6 5 1 2 2 3 4 5 4 6 5 6
Output
1
Hint
In the first sample the following road orientation is allowed:
,
,
.
The second sample:
,
,
,
,
.
The third sample:
,
,
,
,
.
题意:给出一些点和边。要求你把边变成有向边使得入度为0的点最少
分析:对于一些相连的点来说,假设形成的图中有环。那么我们一定可以从环上的某点出发使入度为0的点没有,
假设无环,那么仅仅须要一个入度为0的点就能使其它点入度不为0,那么问题就转换为推断图中是否有环了,
我们从任一个点遍历整个图,然后判环调整答案就可以
#include<cstring> #include<string> #include<iostream> #include<queue> #include<cstdio> #include<algorithm> #include<map> #include<cstdlib> #include<cmath> #include<vector> //#pragma comment(linker, "/STACK:1024000000,1024000000"); using namespace std; #define INF 0x3f3f3f3f vector<int>v[100006]; int vis[100006]; int ans; int flag; void dfs(int s,int f,int pre) { vis[s]=1; for(int i=0; i<v[s].size(); i++) { if(vis[v[s][i]]&&pre!=v[s][i]) flag=-1; else if(!vis[v[s][i]]) { dfs(v[s][i],f,s); } } } int main() { int n,m; while(scanf("%d%d",&n,&m)!=EOF) { memset(vis,0,sizeof vis); for(int i=1; i<=n; i++) v[i].clear(); for(int i=0; i<m; i++) { int a,b; scanf("%d%d",&a,&b); v[a].push_back(b); v[b].push_back(a); } ans=0; for(int i=1; i<=n; i++) { if(!vis[i]) { flag=0; ans++; dfs(i,i,i); ans+=flag; } } printf("%d\n",ans); } return 0; }
相关文章推荐
- Codeforces 397A On Segment's Own Points(遍历)
- Codeforces 8B Obsession With Robot 简单图遍历
- dfs 遍历 codeforces 24A
- codeforces 919D Substring (拓扑排序 遍历所有通路)
- codeforces 839C Journey(图的遍历)
- CodeForces 302B Eugeny and Play List(遍历)
- CodeForces 659E New Reform (图的遍历判环)
- Codeforces 34D. Road Map 树的遍历
- Codeforces 278C. Learning Languages 图的遍历
- CodeForces - Hello 2018 B(树的遍历). C(贪心)
- CodeForces 446B DZY Loves Modification 经典+贪心+更换遍历对象
- Codeforces 34D. Road Map 树的遍历
- Codeforces 278C. Learning Languages 图的遍历
- codeforces 301D. Yaroslav and Divisors(遍历和排序的艺术)
- codeforces - 500A 图的遍历 Java
- CodeForces - 767C Garland 树的遍历
- Codeforces 29D Ant on the Tree 树的遍历 dfs序
- 最快遍历完图中重要节点 树的直径 Codeforces 328 (Div. 2) D. Super M
- Codeforces 29D Ant on the Tree 树的遍历 dfs序
- CodeForces 702B: Powers of Two(遍历、穷举)