poj 1144 Network(模板题)(Tarjan 关节点的朴素算法)
来源:互联网 发布:淘宝免单真的假的 编辑:程序博客网 时间:2024/05/22 13:59
Network
Time Limit: 1000MS
Memory Limit: 10000KTotal Submissions: 11025
Accepted: 5095
Memory Limit: 10000KTotal Submissions: 11025
Accepted: 5095
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.
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;
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
55 1 2 3 4062 1 35 4 6 200
Sample Output
12
思路:
求无向图的关节点模板题,用Tarjan算法,多写几题,弄成模板。
代码:
//292K16MS#include<iostream>#include<cstdio>#include<cstring>using namespace std;#define maxn 101#define min(a,b) ((a)>(b)?(b):(a))int edge[maxn][maxn];int low[maxn];int dfn[maxn];int vis[maxn];int tmpdfn;int nodes;int son;int subnets[maxn];void init(){ low[1]=dfn[1]=1; tmpdfn=1;son=0; memset(vis,0,sizeof(vis)); vis[1]=1; memset(subnets,0,sizeof(subnets));}void dfs(int u){ for(int v=1;v<=nodes;v++) { if(edge[u][v]) { if(!vis[v]) { vis[v]=1; tmpdfn++;low[v]=dfn[v]=tmpdfn; dfs(v); low[u]=min(low[u],low[v]); if(dfn[u]<=low[v]) { if(u!=1) subnets[u]++; if(u==1) son++; } } else low[u]=min(low[u],dfn[v]); } }}int main(){ int u,v; while(~scanf("%d",&nodes)&&nodes) { memset(edge,0,sizeof(edge)); while(scanf("%d",&u) && u) { while(getchar()!='\n') { scanf("%d",&v); edge[u][v]=edge[v][u]=1; } } init(); dfs(1); if(son>1) subnets[1]=son-1; int find=0; for(int i=1;i<=nodes;i++) { if(subnets[i]) find++; } cout<<find<<endl; } return 0;}
0 0
- poj 1144 Network(模板题)(Tarjan 关节点的朴素算法)
- poj 1523 SPF(模板题)(Tarjan 关节点的朴素算法)
- poj 1144 Network 关节点
- POJ 1144 Network Tarjan 求无向图的割点的个数 Tarjan 模板题
- POJ 1236 Network of Schools【tarjan算法】【模板题】
- POJ 1523-SPF(Tarjan算法-关节点)
- Network poj 3694(tarjan 求割边 + lca(朴素的))
- poj 1144 Network (tarjan割点模板)
- poj 1144 Network 图的连通性-关节点个数
- 【关节点+桥】关节点和桥模板 Tarjan
- POJ 1144 Network ---tarjan算法求割点
- [POJ 1144] Network Tarjan算法求割点
- [poj 1144]Network[Tarjan求割点]
- Poj 1144 Network【Tarjan求割点】
- POJ 1144 Network(Tarjan)
- POJ - 2186 Tarjan的模板题..
- Network(特殊的输入格式+tarjan求割点模板题)
- 连通图关节点求解详解--tarjan算法,重连通分量的求解--栈
- DNS域名系统
- Android Java Framework框架层探究
- USACO传送门|二维SPFA
- 关于诚信考试
- 【SQL】10g字符串处理函数regexp_count
- poj 1144 Network(模板题)(Tarjan 关节点的朴素算法)
- 动态网页技术JSP、ASP、PHP
- python调用R
- Java虚拟机类生命周期
- 在CentOS或者RHEL上安装REMI仓库
- EAS F7 左树右表
- #3
- 各种单例的写法
- Scala数据库操作