1718: [Usaco2006 Jan] Redundant Paths 分离的路径
Posted Ed_Sheeran
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了1718: [Usaco2006 Jan] Redundant Paths 分离的路径相关的知识,希望对你有一定的参考价值。
1718: [Usaco2006 Jan] Redundant Paths 分离的路径
Time Limit: 5 Sec Memory Limit: 64 MBDescription
In order to get from one of the F (1 <= F <= 5,000) grazing fields (which are numbered 1..F) to another field, Bessie and the rest of the herd are forced to cross near the Tree of Rotten Apples. The cows are now tired of often being forced to take a particular path and want to build some new paths so that they will always have a choice of at least two separate routes between any pair of fields. They currently have at least one route between each pair of fields and want to have at least two. Of course, they can only travel on Official Paths when they move from one field to another. Given a description of the current set of R (F-1 <= R <= 10,000) paths that each connect exactly two different fields, determine the minimum number of new paths (each of which connects exactly two fields) that must be built so that there are at least two separate routes between any pair of fields. Routes are considered separate if they use none of the same paths, even if they visit the same intermediate field along the way. There might already be more than one paths between the same pair of fields, and you may also build a new path that connects the same fields as some other path.
Input
* Line 1: Two space-separated integers: F and R * Lines 2..R+1: Each line contains two space-separated integers which are the fields at the endpoints of some path.
Output
* Line 1: A single integer that is the number of new paths that must be built.
Sample Input
1 2
2 3
3 4
2 5
4 5
5 6
5 7
Sample Output
HINT
题解:边双连通分量裸题
#include<bits/stdc++.h> using namespace std; const int maxn = 10005, inf = 1000000008; int du[maxn], dfn[maxn],low[maxn],h[maxn],place[maxn],tot,idx,scccnt; bool ins[maxn], vis[maxn<<1]; struct edge{ int v,nxt; }G[maxn<<1]; stack <int> s; void add(int u,int v){ G[++tot].nxt = h[u]; h[u] = tot; G[tot].v = v; } void tarjan(int u, int d){ dfn[u] = low[u] = ++idx; s.push(u); ins[u] = 1; for(int i = h[u]; i; i = G[i].nxt){ if(vis[i^1])continue; vis[i] = 1; int v = G[i].v; if(!dfn[v]){ tarjan(v, i); low[u] = min(low[u], low[v]); } else if(ins[v]) low[u] = min(low[u], dfn[v]); } if(low[u] == dfn[u]){ scccnt++; while(1){ int t = s.top(); ins[t] = 0; place[t] = scccnt; s.pop(); if(t == u)break; } } } int main(){ int F, R, leaf = 0; tot = 1; scanf("%d%d",&F,&R); for(int i = 1; i <= R; i++){ int u,v; scanf("%d%d",&u, &v); add(u, v); add(v, u); } for(int i = 1; i <= F; i++) if(!dfn[i])tarjan(i, inf); for(int i = 1; i <= F; i++) for(int j = h[i]; j; j = G[j].nxt){ int v = G[j].v; if(place[i] != place[v]) du[place[i]]++; } for(int i = 1; i <= scccnt; i++) if(du[i] == 1)leaf++; printf("%d\n",(leaf+1)/2); }
以上是关于1718: [Usaco2006 Jan] Redundant Paths 分离的路径的主要内容,如果未能解决你的问题,请参考以下文章
BZOJ1718 [Usaco2006 Jan] Redundant Paths 分离的路径
BZOJ 1718: [Usaco2006 Jan] Redundant Paths 分离的路径
BZOJ1718: [Usaco2006 Jan] Redundant Paths 分离的路径
1654: [Usaco2006 Jan]The Cow Prom 奶牛舞会