POJ 1144--Network 【无向图中割点总数】
2015-08-12 17:56
465 查看
Network
Description
A Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting several places numbered by integers from 1 to N . No two places have the same number. The lines are bidirectional and always connect together two places and in
each place the lines end in a telephone exchange. There is one telephone exchange in each place. From each place it is
possible to reach through lines every other place, however it need not be a direct connection, it can go through several exchanges. From time to time the power supply fails at a place and then the exchange does not operate. The officials from TLC realized that
in such a case it can happen that besides the fact that the place with the failure is unreachable, this can also cause that some other places cannot connect to each other. In such a case we will say the place (where the failure
occured) is critical. Now the officials are trying to write a program for finding the number of all such critical places. Help them.
Input
The input file consists of several blocks of lines. Each block describes one network. In the first line of each block there is the number of places N < 100. Each of the next at most N lines contains the number of a place followed by the numbers of some places
to which there is a direct line from this place. These at most N lines completely describe the network, i.e., each direct connection of two places in the network is contained at least in one row. All numbers in one line are separated
by one space. Each block ends with a line containing just 0. The last block has only one line with N = 0;
Output
The output contains for each block except the last in the input file one line containing the number of critical places.
Sample Input
Sample Output
Hint
You need to determine the end of one line.In order to make it's easy to determine,there are no extra blank before the end of each line.
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 10764 | Accepted: 4978 |
A Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting several places numbered by integers from 1 to N . No two places have the same number. The lines are bidirectional and always connect together two places and in
each place the lines end in a telephone exchange. There is one telephone exchange in each place. From each place it is
possible to reach through lines every other place, however it need not be a direct connection, it can go through several exchanges. From time to time the power supply fails at a place and then the exchange does not operate. The officials from TLC realized that
in such a case it can happen that besides the fact that the place with the failure is unreachable, this can also cause that some other places cannot connect to each other. In such a case we will say the place (where the failure
occured) is critical. Now the officials are trying to write a program for finding the number of all such critical places. Help them.
Input
The input file consists of several blocks of lines. Each block describes one network. In the first line of each block there is the number of places N < 100. Each of the next at most N lines contains the number of a place followed by the numbers of some places
to which there is a direct line from this place. These at most N lines completely describe the network, i.e., each direct connection of two places in the network is contained at least in one row. All numbers in one line are separated
by one space. Each block ends with a line containing just 0. The last block has only one line with N = 0;
Output
The output contains for each block except the last in the input file one line containing the number of critical places.
Sample Input
5 5 1 2 3 4 0 6 2 1 3 5 4 6 2 0 0
Sample Output
1 2
Hint
You need to determine the end of one line.In order to make it's easy to determine,there are no extra blank before the end of each line.
#include <cstdio> #include <cstring> #include <algorithm> #include <queue> #include <stack> #define maxn 1000+10 #define maxm 2000000+10 using namespace std; struct node { int u, v, next; }; node edge[maxm]; int head[maxn], cnt; bool is_cut[maxn]; int low[maxn], dfn[maxn]; int dfs_clock; void init(){ cnt = 0; memset(head, -1, sizeof(head)); } void addedge(int u, int v){ edge[cnt] = {u, v, head[u]}; head[u] = cnt++; edge[cnt] = {v, u, head[v]}; head[v] = cnt++; } void tarian(int u, int fa){ low[u] = dfn[u] = ++dfs_clock; int son = 0; for(int i = head[u]; i != -1; i = edge[i].next){ int v = edge[i].v; if(!dfn[v]){ son++; tarian(v, u); low[u] = min(low[u], low[v]); if( u != fa && low[v] >= dfn[u]) is_cut[u] = true; } else low[u] = min(low[u], dfn[v]); } if(fa == u && son > 1) is_cut[u] = true; } void find(int l, int r){ memset(low, 0, sizeof(low)); memset(dfn, 0, sizeof(dfn)); memset(is_cut, 0, sizeof(is_cut)); for(int i = l; i <= r; ++i) if(!dfn[i]) tarian(i, i); } int main (){ int n; while(scanf("%d", &n), n){ init(); int u, v; while(scanf("%d", &u), u){//输入方式一种小技巧 while(getchar() != '\n'){ scanf("%d", &v); addedge(u, v); } } find(1, n); int ans = 0; for(int i = 1; i <= n; ++i) if(is_cut[i]) ans++; printf("%d\n", ans); } return 0; }
相关文章推荐
- Java删除ArrayList中的重复元素的2种方法
- volatile 续
- UVa10025-The ? 1 ? 2 ? ... ? n = k problem
- Ubuntu 安装和配置minicom
- Android 动画效果 及 自定义动画
- POJ2773 Happy 2006【容斥原理】
- ASP.NET Web API 记录请求响应数据到日志的一个方法
- xilinx ise 的planahead的使用1
- MSSQL表分区的创建, 横向 纵向 多维度,多指标 分表
- 东风风神汽车4S店管理系统
- 【SEO工作】对济南增高医院优化站的计划、实施方法
- JavaScript在IE6,IE7下报错'expected identifier, string or number'
- 原生js显示分页效果
- php 字符串长度函数
- oracle官网下载老版本jdk + 如何命令行下wget下载jdk
- select,poll,epoll比较
- 探索推荐引擎内部的秘密,第 2 部分: 深入推荐引擎相关算法 - 协同过滤
- C#薪酬管理子系统
- php data函数参数大全
- 关于浅拷贝,深拷贝