poj 3352
来源:互联网 发布:巨杉数据库公司怎么样 编辑:程序博客网 时间:2024/06/18 09:06
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
Source
CCC 2007
AC代码:
#include<iostream>#include<vector>#include<algorithm>#include<stdio.h>using namespace std;int n,m;int st;int pre[1005],low[1005],degree[1005];vector <int> G[1005];void dfs(int u,int fa){ //找出边联通分量保存在low中 pre[u]=low[u]=++st; for(int i=0;i<G[u].size();i++){ int v=G[u][i]; if(v==fa) continue; if(!pre[v]) dfs(v,u); low[u]=min(low[u],low[v]); }}int main(){ while(scanf("%d%d",&n,&m)!=EOF){ st=0; for(int i=1;i<=n;i++){ G[i].clear(); degree[i]=pre[i]=low[i]=0; } while(m--){ int x,y; scanf("%d%d",&x,&y); G[x].push_back(y); G[y].push_back(x); } dfs(1,-1); for(int i=1;i<=n;i++){ for(int j=0;j<G[i].size();j++){ int v=G[i][j]; if(low[i]!=low[v]) degree[low[i]]++; } } int ans=0; for(int i=1;i<=n;i++) if(degree[i]==1) ans++; printf("%d\n",(ans+1)/2); } return 0;}
- poj 3177 poj 3352
- poj--3352
- poj 3352
- POJ 3352
- POJ 3177 Redundant Paths && POJ 3352
- POJ 3352 3177 //桥
- POJ 3352 || POJ3177
- poj 3352 Road Construction
- 【代码】POJ 3352
- POJ 3352 Road Construction
- POJ 3352: Road Construction
- poj 3352 双连通
- poj 3352
- POJ 3352 Road Construction
- POJ 3352 求割边
- poj 3352 Road Construction
- poj 3352 Road Construction
- POJ 3352 Road Construction
- log系统的基本规范
- struts2之Action配置的各项默认值、result配置的各种试图转发类型及为应用指定多个
- 智能可视化物资仓储管理实训平台(CY-WZCC-100)
- QGIS相关下载
- SqlPrompt相关教程
- poj 3352
- 手把手教你创建第一个IOS应用
- Hibernate4之session核心方法
- Spring AOP原理
- VBS基础篇 - 对象(1) - Class对象
- 最简单的用jquery实现动画的跳到顶部和底部
- 归并排序
- extern static 在c中的使用方法
- 自定义View自定义属性