poj1129_Channel Allocation
来源:互联网 发布:张银奎 软件调试 编辑:程序博客网 时间:2024/05/21 05:57
Channel Allocation
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11194 Accepted: 5744
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. 分析:图着色问题,邻接表建图加dfs。#include <iostream>#include <cstdio>#include <cstring>#include <cstdlib>using namespace std;typedef struct Node{int num;struct Node *next;}Node;struct Mgrage{Node *head;};Mgrage map[30];int x[30];int n, cornum;void init()//图的初始化{for (int i = 0; i < 30; i++)map[i].head = NULL;}void insert(char ch, char c)//邻接表建图{int k = ch - 'A';int l = c - 'A';Node *p, *q;p = (Node *) malloc(sizeof(Node));p->num = l;p->next = NULL;q = map[k].head;if (q == NULL)map[k].head = p;else {while (q->next != NULL)q = q->next;q->next = p;}}bool ok(int num, int col)//检查颜色是否可用{Node *p;p = map[num].head;while (p){if (x[p->num] == col)return 0;p = p->next;}return 1;}bool dfs(int num, int sum){if (sum == n)return 1; for (int i = 1; i <= cornum; i++){if (ok(num, i)){x[num] = i;if (dfs(num + 1, sum + 1))return 1;x[num] = 0;}}return 0;}int main(){while (scanf("%d", &n) == 1 && n != 0){getchar();init();memset(x, 0, sizeof(x));int num = n;while (num--){char a[35] = {0};gets(a);int len = strlen(a);int i;for (i = 2; i < len; i++)insert(a[0], a[i]);}cornum = 1;//记录最少的颜色总数while (!dfs(0, 0)){++cornum;memset(x, 0, sizeof(x));}if (cornum == 1)printf("1 channel needed.\n");elseprintf("%d channels needed.\n", cornum);}return 0;}
- poj1129_Channel Allocation
- Memory Allocation
- Stack Allocation
- Channel Allocation
- poj1129Channel Allocation
- Channel Allocation
- uva_259_Software Allocation
- allocation tracker
- Channel Allocation
- CPU Allocation
- Memory allocation with strings
- DomUs and memory allocation
- Windows Memory Allocation Limitations
- Oracle Resumable Space Allocation
- JOJ 1003 Channel Allocation
- Stack vs Heap Allocation
- Memorky Layout and Allocation
- Latent Dirichlet Allocation
- 新书出版:《iPhone&iPad企业移动应用开发秘籍》
- Code Review
- 【清澄】A1010. 进制转换1
- LCD 驱动过程详解
- Java Xml 的四种解析方式
- poj1129_Channel Allocation
- MyEclipse 快捷键
- MemberCache学习
- QQ好友列表树形列表简单实现方式
- Maven学习笔记(二)---Myeclipse配置maven
- 登陆、非登陆shell,交互、非交互shell,以及它们的startup文件
- 伪静态 url 重写 apache linux
- 在OSGI容器Equinox中嵌入HttpServer
- lua语法学习