POJ 3177 Redundant Paths (双连通分量Tarjan算法)
2018-02-18 21:54
375 查看
本题是求无向图的边双连通分量
Total Submissions: 16954 Accepted: 7075
Description
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
7 7
1 2
2 3
3 4
2 5
4 5
5 6
5 7
Sample Output
2
Hint
Explanation of the sample:
One visualization of the paths is:
1 2 3
+—+—+
| |
| |
6 +—+—+ 4
/ 5
/
/
7 +
Building new paths from 1 to 6 and from 4 to 7 satisfies the conditions.
1 2 3
+—+—+
| |
| |
6 +—+—+ 4
/ 5 :
/ :
/ :
7 + - - - -
Check some of the routes:
1 – 2: 1 –> 2 and 1 –> 6 –> 5 –> 2
1 – 4: 1 –> 2 –> 3 –> 4 and 1 –> 6 –> 5 –> 4
3 – 7: 3 –> 4 –> 7 and 3 –> 2 –> 5 –> 7
Every pair of fields is, in fact, connected by two routes.
It’s possible that adding some other path will also solve the problem (like one from 6 to 7). Adding two paths, however, is the minimum.
Source
USACO 2006 January Gold
Redundant Paths(POJ 3177)
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16954 Accepted: 7075
Description
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
7 7
1 2
2 3
3 4
2 5
4 5
5 6
5 7
Sample Output
2
Hint
Explanation of the sample:
One visualization of the paths is:
1 2 3
+—+—+
| |
| |
6 +—+—+ 4
/ 5
/
/
7 +
Building new paths from 1 to 6 and from 4 to 7 satisfies the conditions.
1 2 3
+—+—+
| |
| |
6 +—+—+ 4
/ 5 :
/ :
/ :
7 + - - - -
Check some of the routes:
1 – 2: 1 –> 2 and 1 –> 6 –> 5 –> 2
1 – 4: 1 –> 2 –> 3 –> 4 and 1 –> 6 –> 5 –> 4
3 – 7: 3 –> 4 –> 7 and 3 –> 2 –> 5 –> 7
Every pair of fields is, in fact, connected by two routes.
It’s possible that adding some other path will also solve the problem (like one from 6 to 7). Adding two paths, however, is the minimum.
Source
USACO 2006 January Gold
这道题考察的是无向图的边双连通分量。。。
#include <iostream> #include <cstdio> #include <algorithm> #include <stack> #include <cstring> using namespace std; int n,m; const int MAXN = 1004 b5d6 ; struct Edge{ int next,to; } edge[MAXN*5]; int head[MAXN]; int DFN[MAXN],low[MAXN],belong[MAXN],du[MAXN]; int ecnt = 1,ji,ans,cntt;//cntt表示边双连通分量的个数 stack<int>s; void add(int u,int v){ edge[ecnt].to = v; edge[ecnt].next = head[u]; head[u] = ecnt++; } void tarjan(int x,int fa){ low[x] = DFN[x] = ++ji; s.push(x); for(int i = head[x]; i; i = edge[i].next){ int to = edge[i].to; if(to != fa){ if(DFN[to] == -1){ tarjan(to,x); low[x] = min(low[to],low[x]); }else{ low[x] = min(low[x],DFN[to]); } } } if(low[x] > DFN[fa]){ cntt++; while(1){ int temp = s.top(); s.pop(); belong[temp] = cntt; if(temp == x)break; } } } int lian[MAXN][MAXN]; int main(){ scanf("%d %d",&n,&m); for(int i = 1; i <= n; i++){ DFN[i] = -1; } for(int i = 1; i <= m; i++){ int u,v; scanf("%d %d",&u,&v); if(lian[u][v] == 1)continue; lian[u][v] = lian[v][u] = 1; add(u,v); add(v,u); } tarjan(1,0); for(int i = 1; i <= n; i++){ for(int j = head[i]; j; j = edge[j].next){ int to = edge[j].to; if(belong[to] != belong[i]){ du[belong[to]]++; du[belong[i]]++; } } } for(int i = 1; i <= n; i++){ du[i] /=2; } for(int i = 1; i <= n; i++){ if(du[i] == 1){ ans++; } } ans = (ans+1)/2; cout<<ans<<endl; }
相关文章推荐
- poj3177——Redundant Paths(双连通分量)
- POJ-3177 Redundant Paths (边双连通分量[Tarjan])
- poj 3177 Redundant Paths(双连通分量)
- poj 3177 Redundant Paths(Tarjan,边双连通分量)
- 【POJ 3177】Redundant Paths(Tarjan求桥、边双连通分量)
- tarjan算法求桥双连通分量 POJ 3177 Redundant Paths
- POJ-3177 Redundant Paths 双连通分量
- POJ 3177 Redundant Paths
- Tarjan算法求解桥和边双连通分量(附POJ 3352 Road Construction解题报告)
- POJ 3177 Redundant Paths
- poj 3177 Redundant Paths【求最少添加多少条边可以使图变成双连通图】【缩点后求入度为1的点个数】
- POJ - 3177 Redundant Paths(边双连通分支)(模板)
- POJ 3177 Redundant Paths(Tarjan)
- poj 3177 Redundant Paths (tarjan)
- POJ 3352 Road Construction&& POJ 3177 Redundant Paths 双联通分量
- poj 3177 Redundant Paths
- POJ 3177 Redundant Paths (边双连通,缩点,判重)
- 【POJ 3177】Redundant Paths
- POJ 3177 Redundant Paths (tarjan bcc)
- POJ 3177--Redundant Paths【无向图添加最少的边成为边双连通图 && tarjan求ebc && 缩点构造缩点树】