POJ3352--Road Construction
2013-07-23 18:12
155 查看
Description
It's almost summer time, and that means that it's almost summer construction time! This year, the good people who are in charge of the roads on the tropical island paradise of Remote Island would like to repair and upgrade the various roads that lead between
the various tourist attractions on the island.
The roads themselves are also rather interesting. Due to the strange customs of the island, the roads are arranged so that they never meet at intersections, but rather pass over or under each other using bridges and tunnels. In this way, each road runs between
two specific tourist attractions, so that the tourists do not become irreparably lost.
Unfortunately, given the nature of the repairs and upgrades needed on each road, when the construction company works on a particular road, it is unusable in either direction. This could cause a problem if it becomes impossible to travel between two tourist
attractions, even if the construction company works on only one road at any particular time.
So, the Road Department of Remote Island has decided to call upon your consulting services to help remedy this problem. It has been decided that new roads will have to be built between the various attractions in such a way that in the final configuration,
if any one road is undergoing construction, it would still be possible to travel between any two tourist attractions using the remaining roads. Your task is to find the minimum number of new roads necessary.
Input
The first line of input will consist of positive integers n and r, separated by a space, where 3 ≤ n ≤ 1000 is the number of tourist attractions on the island, and
2 ≤ r ≤ 1000 is the number of roads. The tourist attractions are conveniently labelled from 1 to n. Each of the following r lines will consist of two integers, v and w,
separated by a space, indicating that a road exists between the attractions labelled v and w. Note that you may travel in either direction down each road, and any pair of tourist attractions will have
at most one road directly between them. Also, you are assured that in the current configuration, it is possible to travel between any two tourist attractions.
Output
One line, consisting of an integer, which gives the minimum number of roads that we need to add.
Sample Input
Sample Output
It's almost summer time, and that means that it's almost summer construction time! This year, the good people who are in charge of the roads on the tropical island paradise of Remote Island would like to repair and upgrade the various roads that lead between
the various tourist attractions on the island.
The roads themselves are also rather interesting. Due to the strange customs of the island, the roads are arranged so that they never meet at intersections, but rather pass over or under each other using bridges and tunnels. In this way, each road runs between
two specific tourist attractions, so that the tourists do not become irreparably lost.
Unfortunately, given the nature of the repairs and upgrades needed on each road, when the construction company works on a particular road, it is unusable in either direction. This could cause a problem if it becomes impossible to travel between two tourist
attractions, even if the construction company works on only one road at any particular time.
So, the Road Department of Remote Island has decided to call upon your consulting services to help remedy this problem. It has been decided that new roads will have to be built between the various attractions in such a way that in the final configuration,
if any one road is undergoing construction, it would still be possible to travel between any two tourist attractions using the remaining roads. Your task is to find the minimum number of new roads necessary.
Input
The first line of input will consist of positive integers n and r, separated by a space, where 3 ≤ n ≤ 1000 is the number of tourist attractions on the island, and
2 ≤ r ≤ 1000 is the number of roads. The tourist attractions are conveniently labelled from 1 to n. Each of the following r lines will consist of two integers, v and w,
separated by a space, indicating that a road exists between the attractions labelled v and w. Note that you may travel in either direction down each road, and any pair of tourist attractions will have
at most one road directly between them. Also, you are assured that in the current configuration, it is possible to travel between any two tourist attractions.
Output
One line, consisting of an integer, which gives the minimum number of roads that we need to add.
Sample Input
Sample Input 1 10 12 1 2 1 3 1 4 2 5 2 6 5 6 3 7 3 8 7 8 4 9 4 10 9 10 Sample Input 2 3 3 1 2 2 3 1 3
Sample Output
Output for Sample Input 1 2 Output for Sample Input 2 0
#include <iostream> #include <cstdio> #include <cstring> using namespace std; #define maxn 4080 int first[maxn],nxt[maxn],vv[maxn],low[maxn],dfn[maxn],rudu[maxn]; int vis[maxn]; int e,cnt; inline int min(int a,int b) { return a>b?b:a; } void addEdge(int u,int v) { vv[e] = v; nxt[e] = first[u]; first[u] = e++; vv[e] = u; nxt[e] = first[v]; first[v] = e++; } void Tarjan(int u,int fa) { vis[u] = 1; dfn[u] = low[u] = ++cnt; for(int i = first[u];i != -1;i = nxt[i]) { int v = vv[i]; if(vis[v] == 1 && v != fa) { low[u] = min(low[u],dfn[v]); } if(vis[v] == 0) { Tarjan(v,u); low[u] = min(low[u],low[v]); } } vis[u] = 2; } int main() { int n,m; while(scanf("%d%d",&n,&m)==2) { e = cnt = 0; memset(vis,0,sizeof(vis)); memset(first,-1,sizeof(first)); memset(dfn,0,sizeof(dfn)); memset(rudu,0,sizeof(rudu)); for(int i = 1;i <= m;i++) { int u ,v; scanf("%d%d",&u,&v); addEdge(u,v); } Tarjan(1,-1);///因为图是连通的。所以这样一次就搞定了 //然后low值相同的点构成一个边连通分量。具有相同性质可缩点 //接下来算入度 for(int i = 1;i <= n;i++) { for(int j = first[i];j != - 1;j = nxt[j]) { int v = vv[j]; if(low[i] != low[v]) { rudu[low[v]]++; rudu[low[i]]++; } } } for(int i = 1;i <= n;i++) { rudu[i]/=2; } int ans = 0; for(int i = 1;i <= n;i++) { if(rudu[i] == 1) ans++; } printf("%d\n",(ans+1)/2); } return 0; }
相关文章推荐
- poj3352,3177
- poj3177 && poj3352 边双连通分量缩点
- poj3352
- poj3352 Road Construction(加最少边使图双联通)
- poj3352
- 【POJ3352】Road Construction(边双联通分量)
- 无向图边连通分量(加边使其成为边连通分量)poj3352
- poj3352 Road Construction
- POJ3352-Road Construction
- POJ3352 Road Construction
- poj3352
- poj3352 Road Construction (双连通)
- poj3352 Road Construction 边双连通分量tarjan算法
- POJ3352-Road Construction
- POJ3352-Road Construction
- poj3352 边-双联通分量
- poj3352[无向图双连通分量]
- poj3177 Redundant Paths && poj3352 Road Construction
- poj3352 Road Construction
- poj3352--旅游岛修路--双连通--无向图邻接表的容量是边数量的2倍