割点和桥问题 poj1144模板题
来源:互联网 发布:c语言输出最大公约数 编辑:程序博客网 时间:2024/05/21 08:55
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
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 <iostream>#include <algorithm>#include <cstring>#include<cstdio>#include<string>#include<cmath>#include<cstdlib>#include<vector>#define LL long long#define inf 0x3f3f3f3fusing namespace std;const int MAX=110;int dfn[MAX],low[MAX],head[MAX],visited[MAX];bool cut[MAX];//点1~n是否是割点int n,cnt,k,root;struct Edge{ int to,next;}edge[MAX*MAX];void addedge(int cu,int cv){ edge[cnt].to=cv; edge[cnt].next=head[cu]; head[cu]=cnt++;}void tarjan(int u,int fa){ int son=0; visited[u]=1; dfn[u]=low[u]=++k; for(int i=head[u];i!=-1;i=edge[i].next) { int v=edge[i].to; if(visited[v]==1&&v!=fa) low[u]=min(low[u],dfn[v]); if(visited[v]==0) { tarjan(v,u); son++; low[u]=min(low[u],low[v]); if((u==root&&son>1)||(u!=root&&dfn[u]<=low[v])) cut[u]=1; } } visited[u]=2;}int main(){ while(cin>>n) { if(n==0) return 0; memset(head,-1,sizeof(head)); memset(dfn,0,sizeof(dfn)); memset(low,0,sizeof(low)); memset(visited,0,sizeof(visited)); memset(cut,0,sizeof(cut)); cnt=0; int u,v; while(scanf("%d",&u) && u){ while(getchar()!='\n'){ scanf("%d",&v); addedge(u,v); addedge(v,u); } } root=1; tarjan(root,-1); int ans=0; for(int i=1;i<=n;i++) if(cut[i]) ans++; cout<<ans<<endl; } return 0;}
求割点和桥模板:const int MAX=110;int dfn[MAX],low[MAX],head[MAX],visited[MAX];bool cut[MAX];//点1~n是否是割点int n,cnt,k,root,nume;nume桥的个数struct Edge{ int to,next;}edge[MAX*MAX],cutm[MAX*MAX];//cutm是桥void addedge(int cu,int cv){ edge[cnt].to=cv; edge[cnt].next=head[cu]; head[cu]=cnt++;}void tarjan(int u,int fa){ int son=0; visited[u]=1; dfn[u]=low[u]=++k; for(int i=head[u];i!=-1;i=edge[i].next) { int v=edge[i].to; if(visited[v]==1&&v!=fa) low[u]=min(low[u],dfn[v]); if(visited[v]==0) { tarjan(v,u); son++; low[u]=min(low[u],low[v]); if((u==root&&son>1)||(u!=root&&dfn[u]<=low[v])) cut[u]=1;//if(dfn[u]<low[v]) cute[++nume]=Edge(u,v);求桥 } } visited[u]=2;}int main(){ while(cin>>n) { if(n==0) return 0; memset(head,-1,sizeof(head)); memset(dfn,0,sizeof(dfn)); memset(low,0,sizeof(low)); memset(visited,0,sizeof(visited)); memset(cut,0,sizeof(cut)); cnt=0;//构造边 int u,v; while(scanf("%d",&u) && u){ while(getchar()!='\n'){ scanf("%d",&v); addedge(u,v); addedge(v,u); } }//、、、、、、、、、、、、 root=1; tarjan(root,-1); int ans=0; for(int i=1;i<=n;i++) if(cut[i]) ans++; cout<<ans<<endl;//输出割点个数 }
0 0
- 割点和桥问题 poj1144模板题
- 割点和桥 poj1144
- poj1144 割点模板
- poj1144 求图的割点--模板
- POJ1144-Network(割顶模板题)
- 割点和桥模板
- 割点和桥模板
- poj1144——割点
- 割点,桥模板
- 割点、桥模板
- POJ1144-求图的割点(裸)
- POJ1144 Network(判断割点)
- poj1144 求图的割点
- POJ1144——Tarjan+计算割点
- Tarjin算法求桥和割点模板
- poj1144(求割顶模板题)
- 割点和桥
- 割点和桥
- 欢迎使用CSDN-markdown编辑器
- Android Bluetooth蓝牙技术基础讲解
- JavaScript高级程序设计(读书笔记)(六)
- RxJava(六) retryWhen操作符实现错误重试机制
- 协同过滤之ALS-WR算法
- 割点和桥问题 poj1144模板题
- memched1.0源码阅读(1)——介绍
- a 标记点击后通过ajax返回的布尔值结果进行判断是否在新窗口打开链接
- iOS测试远程推送工具SmartPush-master
- android之onNewIntent()用法
- xcode6如何调试定位错误
- 查验身份证号是否合法
- JAVA集合
- 第三章数据库索引技术