ACM：着色问题 poj 1129

                                                                         Channel Allocation

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.

题意: 现在给你一个图,这个图是每个点和其临近的点, 临近的点不可以用相同的频率(着同样的色).

         现在要你求最少用多少个频率(颜色)可以完成全部覆盖(着色).

解题思路:

                1. 问题模型是着色问题,拿就枚举颜色的个数, 每次枚举看可以完成全部点的着色.

                2. 采用深搜,每一次当前色的种数深搜完毕就加1种知道全部点都被着色完毕, 这样

                    从最少的开始深搜,结果出现肯定是最少的.

代码：

#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
#define MAX 26

int map[MAX][MAX];
int flag[MAX];
int n;
int color;
int mincolor;

bool judge(int reLen,int i)
{
    for(int k = 0; k < n; ++k)
    {
        if(map[reLen][k] && flag[k] == i)  //如果该点与K点相邻且,K点也染了该色,不可以.
            return false;
    }
    return true;
}

void dfs(int reLen)
{
    if(color > mincolor)
        return ;
    if(reLen == n)
    {
        if(mincolor > color)
            mincolor = color;
        return ;
    }
    
    for(int i = 1; i <= color; ++i)
    {
        if( judge(reLen,i) )
        {
            flag[reLen] = i;
            dfs(reLen+1);
            flag[reLen] = 0;
        }
    }
    
    color++;
    flag[reLen] = color;
    dfs(reLen+1);
    flag[reLen] = 0;
    color--;
}

int main()
{
//    freopen("input.txt","r",stdin);
    while(scanf("%d",&n) != EOF && n)
    {    
        char str[MAX+5];
        memset(map,0,sizeof(map));
        memset(flag,0,sizeof(flag));
        for(int i = 0; i < n; ++i)
        {
            scanf("%s",str);
            for(int j = 2; str[j] != '\0'; ++j)
            {
                map[i][str[j]-'A'] = 1;
            }
        }
        
        color = 1;
        mincolor = 1 << 20;
        dfs(0);
        
        if(mincolor == 1)
            printf("1 channel needed.\n");
        else
            printf("%d channels needed.\n",mincolor);
    }
    
    return 0;
}