POJ3352-Road Construction
来源:互联网 发布:肝功能包括乙肝吗 知乎 编辑:程序博客网 时间:2024/06/04 20:01
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 Input 110 121 21 31 42 52 65 63 73 87 84 94 109 10Sample Input 23 31 22 31 3
Sample Output
Output for Sample Input 12Output for Sample Input 20
裸的计算边双连通分量。
#include <iostream>#include <cstdio>#include <cstring>#include <vector>#include <string>#include <algorithm>#include <queue>#include <set>using namespace std;const int maxn = 1000+10;vector<int> G[maxn];int n,m;int dfn[maxn],lown[maxn];int du[maxn];int dfs_clk;void init(){ for(int i = 0; i <= n; i++){ G[i].clear(); } dfs_clk = 0; memset(dfn,0,sizeof dfn); memset(du,0,sizeof du);}int dfs(int u,int fa){ int lowu = dfn[u] = dfs_clk++; for(int i = 0; i < G[u].size(); i++){ int d = G[u][i]; if(!dfn[d]){ int lowv = dfs(d,u); lowu = min(lowu,lowv); } else if(dfn[d] < dfn[u] && d != fa){ lowu = min(lowu,dfn[d]); } } lown[u] = lowu; return lowu;}int main(){ while(~scanf("%d%d",&n,&m)){ init(); while(m--){ int a,b; scanf("%d%d",&a,&b); G[a].push_back(b); G[b].push_back(a); } dfs(1,-1); for(int i = 1; i <= n; i++){ for(int j = 0; j < G[i].size(); j++){ int k = G[i][j]; if(lown[i] != lown[k]){ du[lown[i]]++;//统计入度 } } } int block = 0; for(int i = 0; i < dfs_clk; i++){ if(du[i]==1) ++block; } printf("%d\n",(block+1)/2); } return 0;}
- poj3352 - Road Construction
- POJ3352--Road Construction
- poj3352 Road Construction
- poj3352 Road Construction
- POJ3352-Road Construction
- POJ3352-Road Construction
- poj3352 Road Construction
- poj3352 Road Construction
- poj3352-Road Construction
- poj3352 Road Construction (双连通)
- poj3352 Road Construction 缩点
- POJ3352-Road Construction(边连通分量)
- poj3177 Redundant Paths && poj3352 Road Construction
- POJ3352 Road Construction (双连通分量)
- poj3352 Road Construction(边双连通分量)
- [POJ3352]Road Construction 做题笔记
- poj3352 Road Construction(加最少边使图双联通)
- poj3352——Road Construction//最小割边
- 内存对齐(内存中的数据对齐)、大端模式及小端模式
- 2014年8月接触华为,浪潮,曙光服务器安装系统遇到的一些事情
- 程序设计
- nutch 无法在 eclipse下调试的问题
- C++容器vector和map的正确删除方法
- POJ3352-Road Construction
- ufldl学习笔记与编程作业:Vectorization(向量化/矢量化)
- Hibernate对象状态
- 工厂模式
- windows程序设计-第七章 BLOKOUT1 备注
- const修饰符
- 学车心得
- hdu2025 查找最大元素
- Install EGIT via eclipse marketplace