687E: TOF
来源:互联网 发布:淘宝补单25天 编辑:程序博客网 时间:2024/06/07 05:36
Codeforces Round #360 Editorial [+ Challenges!]
Today Pari gave Arya a cool graph problem. Arya wrote a non-optimal solution for it, because he believes in his ability to optimize non-optimal solutions. In addition to being non-optimal, his code was buggy and he tried a lot to optimize it, so the code also became dirty! He keeps getting Time Limit Exceeds and he is disappointed. Suddenly a bright idea came to his mind!
Here is how his dirty code looks like:
dfs(v){ set count[v] = count[v] + 1 if(count[v] < 1000) { foreach u in neighbors[v] { if(visited[u] is equal to false) { dfs(u) } break } } set visited[v] = true}main(){ input the digraph() TOF() foreach 1<=i<=n { set count[i] = 0 , visited[i] = false } foreach 1 <= v <= n { if(visited[v] is equal to false) { dfs(v) } } ... // And do something cool and magical but we can't tell you what!}
He asks you to write the TOF function in order to optimize the running time of the code with minimizing the number of calls of thedfs function. The input is a directed graph and in theTOF function you have to rearrange the edges of the graph in the listneighbors for each vertex. The number of calls ofdfs function depends on the arrangement ofneighbors of each vertex.
The first line of the input contains two integers n andm (1 ≤ n, m ≤ 5000) — the number of vertices and then number of directed edges in the input graph.
Each of the next m lines contains a pair of integersui andvi (1 ≤ ui, vi ≤ n), meaning there is a directed edge in the input graph.
You may assume that the graph won't contain any self-loops and there is at most one edge between any unordered pair of vertices.
Print a single integer — the minimum possible number of dfs calls that can be achieved with permuting the edges.
3 31 22 33 1
2998
6 71 22 33 13 44 55 66 4
3001
Hint: What the actual problem is
Looking at the code in the statement, you can see only the first edge in neighbors
of each node is important. So for each vertex with at least one outgoing edge, you have to choose one edge and ignore the others. After this the graph becomes in the shape of some cycles with possible branches, and some paths. The number ofdfs
calls equals to 998 × ( sum of sizes of cycles) + n + number of cycles.
Solution
The goal is to minimize the sum of cycle sizes. Or, to maximize the number of vertices which are not in any cycle. Name themgood vertices.
If there exists a vertex v without any outgoing edge, we can make all of the vertices thatv is reachable from them good. Consider the dfs-tree fromv in the reverse graph. You can choose the edge from this tree as the first edge in
neighbors[u]
, in order to make all of these vertices good.Vertices which are not in the sink strongly connected components could become good too, by choosing the edges from a path starting from them and ending in a sink strongly connected component.
In a sink strongly connected component, there exists a path from every vertex to others. So we can make every vertex good except a single cycle, by choosing the edges in the paths from other nodes to this cycle and the cycle edges.
So, every vertices could become good except a single cycle in every sink strongly connected component. And the length of those cycles must be minimized, so we can choose the smallest cycle in every sink strongly connected component and make every other vertices good. Finding the smallest cycle in a graph with n-vertex andm edges could be done in O(n(n + m)) with running a BFS from every vertex, so finding the smallest cycle in every sink strongly connected component isO(n(n + m)) overall.
C++ code
// . .. ... .... ..... be name khoda ..... .... ... .. . \\#include <bits/stdc++.h>using namespace std;inline int in() { int x; scanf("%d", &x); return x; }const int N = 5005;int comp[N], bfsDist[N], bfsPar[N];vector <int> g[N], gR[N];bool mark[N], inCycle[N];bool dfs(int v, vector <int> *g, vector <int> &nodes){mark[v] = 1;for(int u : g[v])if(!mark[u])dfs(u, g, nodes);nodes.push_back(v);}int findSmallestCycle(vector <int> vs){vector <int> cycle;for(int root : vs){for(int v : vs){bfsDist[v] = 1e9;bfsPar[v] = -1;}bfsDist[root] = 0;queue <int> q;q.push(root);bool cycleFound = 0;while(q.size() && !cycleFound){int v = q.front();q.pop();for(int u : g[v]){if(u == root){cycleFound = 1;int curLen = bfsDist[v];if(cycle.empty() || curLen < cycle.size()){cycle.clear();for(; v != -1; v = bfsPar[v])cycle.push_back(v);}break;}if(bfsDist[u] > bfsDist[v] + 1){bfsDist[u] = bfsDist[v] + 1;bfsPar[u] = v;q.push(u);}}}}return cycle.size();}int main(){int n, m;cin >> n >> m;for(int i = 0; i < m; i++){int u = in() - 1;int v = in() - 1;g[u].push_back(v);gR[v].push_back(u);}vector <int> order;for(int i = 0; i < n; i++)if(!mark[i])dfs(i, g, order);fill(mark, mark + n, 0);fill(comp, comp + n, -1);int inCycle = 0, nCycle = 0;for(; order.size(); order.pop_back()){int v = order.back();if(mark[v])continue;vector <int> curComp;dfs(v, gR, curComp);bool isSink = true;for(int u : curComp)comp[u] = v;for(int u : curComp)for(int k = 0; k < g[u].size(); k++)if(comp[g[u][k]] != v)isSink = false;if(isSink){int x = findSmallestCycle(curComp);if(x > 0){ nCycle++; inCycle += x;}}}cout << 999 * inCycle + (n - inCycle) + nCycle << endl;}
原文链接:Codeforces Round #360 Editorial [+ Challenges!] - Codeforces
- 687E: TOF
- TOF相机总结
- TOF-深度传感器技术
- TOF相关总结
- TOF-深度传感器技术
- TOF相机基本知识
- 深度相机之TOF初探
- tof相机很好的总结~
- tof相机很好的总结~
- TOF相机很好的总结
- 关于tof相机很好的总结~
- Time of flight cameras(TOF carmeras)
- 【计算机视觉】time of flight (TOF)
- 深度相机(一)--TOF总结
- TOF相机-非扫描三维成像
- 关于tof相机很好的总结~
- 深度相机之TOF原理详解
- 深度相机(一)--TOF总结
- hiho第二十三周
- 勾股定理一日一证连载41
- 687C: The values you can make
- 给Eclipse添加各类插件
- 687D: Dividing Kingdom II
- 687E: TOF
- Detach Volume 操作 - 每天5分钟玩转 OpenStack(55)
- ECIR 2016 Paper Beyond Factoid QA: Effective Methods for Non-factoid Answer Sentence Retrieval
- ECIR 2016 Paper Modelling User Interest for Zero-query Ranking
- ICDM 2014 Paper ShellMiner Mining Organizational Phrases in Argumentative Texts in Social Media
- 《35岁高中生》
- Redis学习笔记(2)-Redis数据类型
- 基于Dubbo的分布式系统架构-使用Dubbo进行规模服务化前的工程结构优化
- smarty原则及优点