POJ1144Network(求割点模板题)
来源:互联网 发布:网络管理协议有哪些 编辑:程序博客网 时间:2024/06/07 00:34
Network
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7990 Accepted: 3768
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 4
0
6
2 1 3
5 4 6 2
0
0
Sample Output
12
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
/************************************************************************ problem: POJ 1144-network* algorithm: tarjan* 割点判断条件:1:如果点v是DFS序列的根节点,则如果v有一个以上的孩子,* 则v是一个割点。* 2.如果v不是DFS序列根节点,并且点v的任意后继u能追溯到最早的祖先节点* low[u]>=dfn[v],则v是一个割点。* 分类:ACM成长之路* 难度:容易题* author:sgx* date:2013/09/11* PS:水题还WA两发,无语了。。。原来是求割点的时候忘了判断u==father只写else不行* 必须写成else(u==father),晕菜~·**************************************************************************/#include <iostream>#include <cstdlib>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn=100+5;struct Edge{ int to; int next;}edge[maxn*20];int head[maxn];int dfn[maxn],low[maxn];bool iscut[maxn];//判断是否为割点;int Bcnt,n;//记录连通分量个数;int cnt,index,son_num;int res;inline int max(int a,int b){ return a>b?a:b;}inline int min(int a,int b){ return a<b?a:b;}inline void addedge(int u,int v){ edge[cnt].to=v; edge[cnt].next=head[u]; head[u]=cnt++;}inline void makemap(int from,int to){ addedge(from,to); addedge(to,from);}inline void tarjan(int u,int father){ dfn[u]=low[u]=++index; for(int i=head[u];~i;i=edge[i].next) { int v=edge[i].to; if(!dfn[v]) { tarjan(v,u); low[u]=min(low[v],low[u]); if(low[v]>=dfn[u]&&u!=father)//判断是否为割点; { iscut[u]=true; } else if(u==father)//这儿WA两次; son_num++; } else low[u]=min(low[u],dfn[v]); }}void solve(){ res=son_num=index=0; memset(dfn,0,sizeof(dfn)); memset(low,0,sizeof(low)); memset(iscut,false,sizeof(iscut)); tarjan(1,1); if(son_num>1) res++; for(int i=2;i<=n;i++) { if(iscut[i]) res++; } printf("%d\n",res);}int main(){ char ch; while(scanf("%d",&n)&&n) { cnt=0; memset(head,-1,sizeof(head)); int u,v; while(scanf("%d",&u)&&u) { while((ch=getchar())!='\n') { scanf("%d",&v); makemap(u,v); } } solve(); } return 0;}
- POJ1144Network(求割点模板题)
- POJ1144Network(割边模板题)
- poj1144Network 无向图求割点Tarjan
- poj1144Network(无向图割点数)
- uva315(求割点模板题)
- 划分树模板+模板题--hdu4251
- 网络流模板(模板题:POJ1273)
- 【模板】三分法 (模板题:洛谷P3382)
- 树链剖分模板题(luogu3384 【模板】树链剖分)
- POJ 3974 Palindrome【manacher】【模板题】【模板】
- 一道C++模板题
- hdu1874 dijkstra模板题
- 凸包模板题
- poj3461 kmp 模板题
- poj3461 KMP模板题
- HDU 2966 模板题
- KMP模板题
- 双向DFS模板题
- 怕病毒吗?无聊!
- mysql基础
- OCP-1Z0-053-V12.02-152题
- XCode&IOS开发
- Android 中LayoutInflater的使用
- POJ1144Network(求割点模板题)
- OCP-1Z0-053-V12.02-272题
- Android如何拍照或选择图片并裁剪
- fileno, stat, fstat以及struct stat结构体(获取文件详细信息)
- 在同一台机器上安装多个版本jdk,修改环境变量不生效
- POJ1236强连通+缩点
- 遍历文件夹,操作XML文件,读取图片
- 菜鸟求职记5
- 从数据库读取图片存到本地