POJ 1144 Network 求割点
2013-11-10 21:26
323 查看
点击打开链接
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.
Source
Central Europe 1996
给你n个点以及它们的联通情况,让你求割点。
算是割点入门题目,注意处理输入时的操作。
Network
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 8297 | Accepted: 3887 |
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.
Source
Central Europe 1996
给你n个点以及它们的联通情况,让你求割点。
算是割点入门题目,注意处理输入时的操作。
#include<stdio.h> #include<string.h> #include<algorithm> #define M 107 using namespace std; int low[M],dfn[M],head[M],cut[M]; int cnt,num,n,root,root_son,ans; struct E { int v,next; }edg[M*20]; void addedge(int u,int v) { edg[cnt].v=v; edg[cnt].next=head[u]; head[u]=cnt++; } void init() { memset(low,0,sizeof(low)); memset(cut,0,sizeof(cut)); memset(dfn,0,sizeof(dfn)); memset(head,-1,sizeof(head)); num=1; cnt=root_son=ans=0; root=1; } void tarjan(int u) { low[u]=dfn[u]=num++; for(int i=head[u];i!=-1;i=edg[i].next) { int v=edg[i].v; if(!dfn[v]) { tarjan(v); if(u==root) root_son++; else { if(low[u]>low[v]) low[u]=low[v]; if(low[v]>=dfn[u]) cut[u]=1; } } else if(low[u]>dfn[v]) low[u]=dfn[v]; } } int main() { while(scanf("%d",&n),n) { init(); int u,v; while(scanf("%d",&u),u) { while(getchar()!='\n') { scanf("%d",&v); addedge(u,v); addedge(v,u); } } tarjan(root); if(root_son>1) cut[root]=1; for(int i=1;i<=n;i++) if(cut[i]) ans++; printf("%d\n",ans); } return 0; }
相关文章推荐
- POJ 1144 Network
- POJ-1144-Network
- 图论(无向图的割顶):POJ 1144 Network
- POJ 1144 / ZOJ 1311 : Network - 割点个数
- POJ 1144 Network 求割点
- UVA315 POJ1144 Network
- POJ 1144 Network(无向图的割顶和桥模板题)
- POJ1144——Network
- POJ 1144 Network(Tarjan)
- poj 1144 Network
- poj_1144/uva_315/zoj_1311 Network(割點模板題)
- POJ 1144 Network 图论 求割点模板
- [poj 1144]Network[Tarjan求割点]
- POJ 1144 Network(简单求无向图割顶数)
- POJ1144 Network 割点
- ZOJ1311, POJ1144 Network
- poj 1144 Network (tarjan求割点)
- POJ 1144 Network 无向图求割点Tarjan
- 【连通图|割点】POJ-1144 Network
- POJ 1144 Network (割点模板题)