CodeForces 659E New Reform (图的遍历判环)
来源:互联网 发布:十大淘宝服装模特 编辑:程序博客网 时间:2024/05/17 06:07
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
4 32 11 34 3
1
5 52 11 32 32 54 3
0
6 51 22 34 54 65 6
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 0x3f3f3f3fvector<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 659E New Reform (图的遍历判环)
- Codeforces--659E--New Reform(深搜好题)
- codeforces 659 E New Reform
- codeforces 659E New Reform
- CodeForces 659E New Reform
- codeforces 659E New Reform
- codeforces 659E New Reform
- CodeForces 659E New Reform
- Codeforces 659E New Reform 【DFS 求环】
- Codeforces 659E New Reform【DFS】
- CodeForces 659E New Reform (DFS)
- Codeforces 659E New Reform【思维+Dfs】
- CodeForces - 659E New Reform (网络流)求最少的入度为0的点的个数
- codeforce 659E New Reform
- Codeforces Round #346 (Div. 2)E. New Reform 乱搞dfs
- Codeforces Round #346 (Div. 2) E. New Reform
- Codeforces Round #346 (Div. 2) E. New Reform
- Codeforces Round #346 (Div. 2)-E. New Reform
- 设计模式-装饰者模式(Decorator)理解和在Android中的应用
- 毕业后去大城市OR回小城市
- 函数
- xcode7 github
- 1019-N皇后问题
- CodeForces 659E New Reform (图的遍历判环)
- 沉浸式状态栏(二)
- 二 :springMVC:方法返回类型
- HDU 2063:过山车【二分匹配】
- ERROR 2002 (HY000): Can't connect to local MySQL server through socket '/var/lib/mysql/mysql.sock'
- 四 :spring mvc处理方法支持如下的返回方式:ModelAndView, Model, ModelMap, Map,View, String, void 使用方法
- 深入 Docker:容器和镜像
- Docker私有仓库搭建
- (Java实现) HDOJ 2023 求平均成绩 面向对象设计思想