joj 1003

 1003: Channel Allocation

Result
TIME Limit
MEMORY Limit
Run Times
AC Times
JUDGE
3s
8192K
3470
639
Standard
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.

Submit / Problem List / Status / Discuss
Problem Set with Online Judge System Version 3.12
이것은 착색 문제로 한 지도에서 네 가지 색깔로 서로 인접한 그림을 다른 색으로 만들 수 있다는 것을 이미 증명했다
#include #include
using namespace std;
int map[27][27];//저장점 간의 위치 관계
int dot[27];//각 점에 사용할 색상 저장
int m;//색상 총 수
bool temp;
boolok(intn)///어떤 점이 염색되었을 때 조건에 부합되는지 판단
{
    for(int i=1;i    if(dot[i]==dot[n]&&map[n][i])return false;
    return true;
}
void dfs(int num,int n)
{
    if(num-1==n)
    {
        temp=true;
        return;
    }
    for(int i=1;i<=m;i++)
    {
        dot[num]=i;
        if(ok(num))dfs(num+1,n);
        dot[num]=0;
    }
}
int main()
{
    int n;
    char store[30];
    while(scanf("%d",&n),n)
    {
        getchar();
        memset(map,0,27*27*sizeof(int));
        memset(dot,0,sizeof(dot));
for(int i=1;i<=n;i++)//각 점의 상대적 위치 입력
        {
            gets(store);
            int count=2;
            while(store[count]!='\0')
            {
                map[i][store[count]-'A'+1]=1;
               ++count;
            }
        }
        temp=false;
        for(m=1;m<=n;m++)
        {
            dfs(1,n);
            if(temp)break;
        }
        if(m==1)printf("1 channel needed.");
        else printf("%d channels needed.",m);
    }
    return 0;
}