CodeForces - 659E New Reform （网络流）求最少的入度为0的点的个数

CodeForces - 659E New Reform Time Limit: 1000MS   Memory Limit: 262144KB   64bit IO Format: %I64d & %I64u Submit Status 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 is not 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 considered separate, 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: the i-th road is determined by two distinct integers xi, yi (1 ≤ xi, yi ≤ n,xi ≠ yi), where xi and yi are the numbers of the cities connected by the i-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 1 1 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: , , , , . //题意： 有n个点，m条边（双向的），问如果将这些边变成单向后，最小入度为0的点的最小个数。 //思路： 记录下每条边，然后从每个没访问过的点往下遍历： #include<stdio.h> #include<string.h> #include<algorithm> #include<iostream> #include<stack> #include<queue> #define INF 0x3f3f3f3f #define ull unsigned long long #define ll long long #define IN __int64 #define N 100010 #define M 1000000007 using namespace std; int vis[N]; vector<int>v[N]; int ans,s; void dfs(int pos,int p) { if(vis[pos]) { ans=0; return ; } vis[pos]=1; for(int i=0;i<v[pos].size();i++) { if(v[pos][i]!=p) dfs(v[pos][i],pos); } } int main() { int t,n,m,i,j,k; while(scanf("%d%d",&n,&m)!=EOF) { for(i=1;i<=n;i++) v[i].clear(); int x,y; for(i=0;i<m;i++) { scanf("%d%d",&x,&y); v[x].push_back(y); v[y].push_back(x); } s=0; memset(vis,0,sizeof(vis)); for(i=1;i<=n;i++) { if(vis[i]) continue; ans=1; dfs(i,0); s+=ans; } printf("%d\n",s); } return 0; }