poj 1129(ID-DFS四色定理)
来源:互联网 发布:女生多大结婚合适 知乎 编辑:程序博客网 时间:2024/05/17 08:24
Channel Allocation
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11099 Accepted: 5700
Description
When a radio station is broadcasting over a very large area, repeaters are used to retransmit the signal so that every receiver has a strong signal. However, the channels used by each repeater must be carefully chosen so that nearby repeaters do not interfere with one another. This condition is satisfied if adjacent repeaters use different channels.
Since the radio frequency spectrum is a precious resource, the number of channels required by a given network of repeaters should be minimised. You have to write a program that reads in a description of a repeater network and determines the minimum number of channels required.
Since the radio frequency spectrum is a precious resource, the number of channels required by a given network of repeaters should be minimised. You have to write a program that reads in a description of a repeater network and determines the minimum number of channels required.
Input
The input consists of a number of maps of repeater networks. Each map begins with a line containing the number of repeaters. This is between 1 and 26, and the repeaters are referred to by consecutive upper-case letters of the alphabet starting with A. For example, ten repeaters would have the names A,B,C,...,I and J. A network with zero repeaters indicates the end of input.
Following the number of repeaters is a list of adjacency relationships. Each line has the form:
A:BCDH
which indicates that the repeaters B, C, D and H are adjacent to the repeater A. The first line describes those adjacent to repeater A, the second those adjacent to B, and so on for all of the repeaters. If a repeater is not adjacent to any other, its line has the form
A:
The repeaters are listed in alphabetical order.
Note that the adjacency is a symmetric relationship; if A is adjacent to B, then B is necessarily adjacent to A. Also, since the repeaters lie in a plane, the graph formed by connecting adjacent repeaters does not have any line segments that cross.
Following the number of repeaters is a list of adjacency relationships. Each line has the form:
A:BCDH
which indicates that the repeaters B, C, D and H are adjacent to the repeater A. The first line describes those adjacent to repeater A, the second those adjacent to B, and so on for all of the repeaters. If a repeater is not adjacent to any other, its line has the form
A:
The repeaters are listed in alphabetical order.
Note that the adjacency is a symmetric relationship; if A is adjacent to B, then B is necessarily adjacent to A. Also, since the repeaters lie in a plane, the graph formed by connecting adjacent repeaters does not have any line segments that cross.
Output
For each map (except the final one with no repeaters), print a line containing the minumum number of channels needed so that no adjacent channels interfere. The sample output shows the format of this line. Take care that channels is in the singular form when only one channel is required.
Sample Input
2A:B:4A:BCB:ACDC:ABDD:BC4A:BCDB:ACDC:ABDD:ABC0
Sample Output
1 channel needed.3 channels needed.4 channels needed.
Source
Southern African 2001
ID-DFS求解这道题比较容易(interative deepening depth-first search)
第一次样例测试失败,是因为没有处理好输入(本来应该是从line读取字符,结果写成了cin获取字符)。
注意四色定理的直观描述:
任意一个无飞地的地图都可以用四种颜色染色,使得没有两个相邻国家染的颜色相同。事实上实际的地图往往是有飞地的,比如很多国家会有两块地方。
提交记录:
1、Accepted!
- poj 1129(ID-DFS四色定理)
- poj 1129(DFS+四色定理)
- POJ 1129 Channel Allocation dfs(四色定理)
- poj 1129(dfs+图的四色定理)
- POJ 1129 Channel Allocation (四色定理+DFS)
- POJ-1129-Channel Allocation-dfs搜索+四色定理
- POJ 1129 Channel Allocation DFS+四色定理
- POJ 1129 Channel Allocation(DFS + 四色定理)
- [Poj 1129] Channel Allocation DFS+四色定理剪支
- POJ Channel Allocation 1129(dfs+四色定理)
- POJ 1129 Channel Allocation (dfs+四色定理)
- poj 1129 四色定理
- poj 1129 Channel Allocation (四色定理)
- poj-1129-Channel Allocation-四色定理
- POJ 1129 四色定理+spfa
- POJ 1129 图的四色定理
- HDU 5113我不是四色定理 dfs
- poj 1129 四色原理DFS
- UVA 152 Tree's a Crowd (简单计算)
- java编程规范
- poj 2676(dfs求解数独问题,对行列和格子分别加bool数组优化搜索)
- TCategoryPanelGroup 收起 展开 控件 收缩 伸展
- Windows 7 + VMWare 8 32-bit 装CentOS 6.4 64-bit
- poj 1129(ID-DFS四色定理)
- 仿Win8按钮磁贴效果
- WCS 支付流程说明
- 目标决定成功
- 新浪笔试(c语言开发)
- hdu2074叠箩筐(画图--找规律)
- 准备工作—PPT配色篇
- nefu120 梅森素数 Lucas-Lehmer判定法
- 如何写技术文档