[POJ 1523]题解
来源:互联网 发布:凤岗淘宝培训 编辑:程序博客网 时间:2024/05/29 19:24
没什么好说的。。就是YZOI1171..
SPF
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6225 Accepted: 2863
Description
Consider the two networks shown below. Assuming that data moves around these networks only between directly connected nodes on a peer-to-peer basis, a failure of a single node, 3, in the network on the left would prevent some of the still available nodes from communicating with each other. Nodes 1 and 2 could still communicate with each other as could nodes 4 and 5, but communication between any other pairs of nodes would no longer be possible.
Node 3 is therefore a Single Point of Failure (SPF) for this network. Strictly, an SPF will be defined as any node that, if unavailable, would prevent at least one pair of available nodes from being able to communicate on what was previously a fully connected network. Note that the network on the right has no such node; there is no SPF in the network. At least two machines must fail before there are any pairs of available nodes which cannot communicate.
Node 3 is therefore a Single Point of Failure (SPF) for this network. Strictly, an SPF will be defined as any node that, if unavailable, would prevent at least one pair of available nodes from being able to communicate on what was previously a fully connected network. Note that the network on the right has no such node; there is no SPF in the network. At least two machines must fail before there are any pairs of available nodes which cannot communicate.
Input
The input will contain the description of several networks. A network description will consist of pairs of integers, one pair per line, that identify connected nodes. Ordering of the pairs is irrelevant; 1 2 and 2 1 specify the same connection. All node numbers will range from 1 to 1000. A line containing a single zero ends the list of connected nodes. An empty network description flags the end of the input. Blank lines in the input file should be ignored.
Output
For each network in the input, you will output its number in the file, followed by a list of any SPF nodes that exist.
The first network in the file should be identified as "Network #1", the second as "Network #2", etc. For each SPF node, output a line, formatted as shown in the examples below, that identifies the node and the number of fully connected subnets that remain when that node fails. If the network has no SPF nodes, simply output the text "No SPF nodes" instead of a list of SPF nodes.
The first network in the file should be identified as "Network #1", the second as "Network #2", etc. For each SPF node, output a line, formatted as shown in the examples below, that identifies the node and the number of fully connected subnets that remain when that node fails. If the network has no SPF nodes, simply output the text "No SPF nodes" instead of a list of SPF nodes.
Sample Input
1 25 43 13 23 43 501 22 33 44 55 101 22 33 44 66 32 55 100
Sample Output
Network #1 SPF node 3 leaves 2 subnetsNetwork #2 No SPF nodesNetwork #3 SPF node 2 leaves 2 subnets SPF node 3 leaves 2 subnets
Source
Greater New York 2000
Code:const shuru='test.in'; shuchu='test.out'; maxn=1001; maxm=500001;varans,dfn,low,headlist:array[0..maxn] of longint;next,t:array[0..maxm] of longint;vis:array[0..maxn] of boolean;pp,tot,x,y,i,j,k,n,m,time,num:longint;sign:boolean;procedure init;beginfor i:=1 to 1000 do headlist[i]:=-1;fillchar(vis,sizeof(vis),false);fillchar(ans,sizeof(ans),0);num:=0;while x<>0 dobeginreadln(y);inc(num);next[num]:=headlist[x];headlist[x]:=num;t[num]:=y;inc(num);next[num]:=headlist[y];headlist[y]:=num;t[num]:=x;read(x);end;end;function min(a,b:longint):longint;beginif a<b then exit(a);exit(b);end;procedure dfs(u,fa:longint);var i:longint;begininc(time); dfn[u]:=time; low[u]:=time;vis[u]:=true;i:=headlist[u];while i<>-1 dobeginif not(vis[t[i]]) then begindfs(t[i],u);if low[t[i]]>=dfn[u] then inc(ans[u]);low[u]:=min(low[u],low[t[i]]); end else if t[i]<>fa then low[u]:=min(low[u],dfn[t[i]]);i:=next[i];end;end;procedure main;begininc(pp);sign:=true;init;ans[1]:=-1;dfs(1,0);writeln('Network #',pp);for i:=1 to maxn do if ans[i]>0 then beginwriteln(' SPF node ',i,' leaves ',ans[i]+1,' subnets');sign:=false; end;if sign then writeln(' No SPF nodes');writeln;end;beginassign(input,shuru);assign(output,shuchu);reset(input);rewrite(output);read(x);while x<>0 dobeginmain;read(x);end;end.
0 0
- [POJ 1523]题解
- POJ 1011 题解
- poj-1050 题解
- poj-1088题解
- poj-1159题解
- POJ 1009题解
- POJ 1458题解
- Poj 2352 Stars 题解
- POJ 2739题解---小菜
- POJ 1753题解
- POJ 1328题解
- POJ 2049题解
- poj 2679题解
- poj 1149题解
- poj 2790迷宫题解
- POJ - Counterfeit Dollar 题解
- poj 2318 TOY题解
- POJ 1026 Cipher 题解
- 使用set集合出来list列表的计算
- 如何使用命令烧录boot.img和recovery.img
- Shell建立网内任意两台机器信任关系
- 【cocos2d-x-3.1.1系列3】cocos2d渲染时候有的显卡要图片是2次幂的 ccNextPOT
- java jdk环境配置
- [POJ 1523]题解
- 为什么在Python3.4.1里输入print 10000L或10000L失败
- MFC 百度百科 介绍
- 1001. A+B Format (20)
- Spring集成JMS
- 关于 paddingFactor 及 COLLMOD 的设置值
- 哈文将三度执导春晚
- Android Drawable 和String 相互转化
- PowerDesigner 面向对象模型(OOM)说明