POJ-1129 Channel Allocation 解题报告
2012-03-11 23:17
363 查看
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.
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.
题目链接:http://poj.org/problem?id=1129
解法类型:四色图问题
解题思路:这个题目暴力搜索也可以做出来,只是算法的效率很低。稍加转换一下就可以变成了四色图问题,即用n种颜色去涂地图,n<=4;这里可以看做最多有26种颜色,求最少的颜色数涂法。直接从每一点开始涂色就可以了,如果与当前发生冲突,则换一种颜色继续涂该点,否则当前点为该颜色。如此下去,直到全部涂色完。PS:这个算法的效率很高,status排名13,头一次这么靠前啊。。
算法实现:
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.
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.
题目链接:http://poj.org/problem?id=1129
解法类型:四色图问题
解题思路:这个题目暴力搜索也可以做出来,只是算法的效率很低。稍加转换一下就可以变成了四色图问题,即用n种颜色去涂地图,n<=4;这里可以看做最多有26种颜色,求最少的颜色数涂法。直接从每一点开始涂色就可以了,如果与当前发生冲突,则换一种颜色继续涂该点,否则当前点为该颜色。如此下去,直到全部涂色完。PS:这个算法的效率很高,status排名13,头一次这么靠前啊。。
算法实现:
//STATUS:C++_AC_0MS_120K #include<stdio.h> #include<memory.h> const int MAXN=27; int search(); int is_ok(int line,int tar); char map[MAXN],vis[MAXN][MAXN]; int n,min; int main() { // freopen("in.txt","r",stdin); int i,j; while(scanf("%d",&n)&&n) { min=0x80000000; memset(vis,0,sizeof(vis)); for(i=0;i<n;i++){ scanf("%s",map); for(j=0;map[j]!='\0';j++) if(map[j]!=':')vis[i][map[j]-'A']=1; } search(); printf("%d ",min); printf("%s needed.\n",min==1?"channel":"channels"); } return 0; } int search() { int i,j,k; for(i=0;i<n;i++){ //依次给每一点涂色 for(j=1;is_ok(i,j);j++); //是否冲突 if(j>min)min=j; //是否为最小值 for(k=0;k<n;k++) //标记 if(vis[k][i])vis[k][i]=j; } return 1; } int is_ok(int line,int tar) //判断与前面的状态是否冲突 { int i,j; for(i=0;i<line;i++){ if(vis[i][line]){ if(line==i) for(j=0;j<line;j++){ if(vis[i][j]==tar)return 1; //冲突 } else { if(vis[i][i]==tar)return 1; //冲突 } } } return 0; //不冲突 }
相关文章推荐
- POJ - 1129 Channel Allocation解题报告(涂色问题+四色定理)
- POJ-1129 Channel Allocation 解题报告
- poj解题报告——1129
- POJ-1129 Pie 解题报告
- POJ_1129 pie 解题报告
- POJ 2976 ALL in ALL 解题报告
- POJ 1979 Red and Black 解题报告
- POJ 1971 Parallelogram Counting 解题报告
- poj1753 Flip Game 解题报告
- poj 1010 STAMPS 解题报告 -- 搜索 遍历 剪枝
- POJ解题整理报告1
- poj - 1185 炮兵阵地 状压DP 解题报告
- 【解题报告】POJ-1108 Split Windows
- poj 1127-Jack Straws解题报告
- POJ 2993 Emag eht htiw Em Pleh解题报告
- 【原创】POJ 1703 && RQNOJ 能量项链解题报告
- POJ 2488解题报告
- poj 1102.LC-Display 解题报告
- poj 2773 Happy 2006解题报告 <欧拉函数>
- poj1001Exponentiation解题报告