1003: Channel Allocation 着色问题 4色定理
2010-08-08 22:15
183 查看
1003: Channel Allocation
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.
Result | TIME Limit | MEMORY Limit | Run Times | AC Times | JUDGE |
---|---|---|---|---|---|
3s | 8192K | 3211 | 561 | Standard |
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.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
2 A: B: 4 A:BC B:ACD C:ABD D:BC 4 A:BCD B:ACD C:ABD D:ABC 0
SAMPLE OUTPUT
1 channel needed. 3 channels needed. 4 channels needed.
#include<iostream> #include<cstdio> #include<string> #include<cstring> using namespace std; int n;//点数 int a[30][30];//邻接矩阵 int x[30];//存颜色 int m;//表示颜色种类 int flag; int check(int id) { for(int i=1;i<id;i++) { if(a[id][i]&&(x[id]==x[i])) return 0;//相邻的出现同一种颜色,不符合 } return 1; } void dfs(int id) { if(id==n+1) { flag=1; return ; } for(int i=1;i<=m;i++)//枚举颜色 { x[id]=i; if(check(id)) dfs(id+1); } } int main() { while(cin>>n&&n) { memset(a,0,sizeof(a)); for(int i=1;i<=n;i++) { string str;cin>>str; for(int j=2;j<str.size();j++) { a[str[0]-'A'+1][str[j]-'A'+1]=a[str[j]-'A'+1][str[0]-'A'+1]=1; } } flag=0; for(m=1;m<=3;m++)//4色定理 { memset(x,0,sizeof(x)); dfs(1); if(flag) break; } if(m==1) printf("1 channel needed./n"); else printf("%d channels needed./n",m); } return 0; }
相关文章推荐
- 回溯经典-m图着色问题(和地图4色问题的区别)
- m图着色问题(和地图4色的区别)
- poj 1129 Channel Allocation(四色定理+着色问题)
- 问题 1003
- 图的着色问题
- 分离轴定理 解决 多边形碰撞 问题
- Polya"数学分析中的问题和定理"前言(节选)
- 顶点着色问题应用
- 贪心算法之区间图着色问题
- acm-1003 求一个数组中连续区间和的最大值问题
- HDU-1003 Max Sum (最大子段和问题DP)
- [中国剩余定理]Hdu 1573——X问题
- JAVA代码—算法基础:四平方定理问题
- 1003. 射击游戏2(出栈次序问题)
- hdu X问题 (中国剩余定理不互质)
- POJ 1129 Channel Allocation DFS搜索 着色问题
- 图的m着色问题 (回溯搜索)
- PTA 图着色问题
- 图的m着色问题
- 分离轴定理解决矩形碰撞问题