poj1129——dfs，四色问题

时间：2015-03-14 13:45:47 阅读：130 评论：0 收藏：0 [点我收藏+]

标签：

POJ 1129 dfs 四色问题

Channel Allocation

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 12799		Accepted: 6558

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. 

题意：在给定的图中涂色，使所有的结点都涂上色且相邻结点颜色不能相同，求最小需要的颜色
思路：dfs，由四色定理可知最多只需四种颜色，故只需遍历四种颜色，从结点1，结点2，...结点n，利用贪心选择性质从颜色1开始涂，涂满时第一个解一定是最优解，图不一定是连通图，因此只能dfs(u){...dfs(u+1)..} 边界为n，而不能直接向四周扩展

/* poj1129_dfs  16ms */
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<vector>

using namespace std;

const int maxn=30;
const int INF=(1<<28);
int N;
vector<int> G[maxn];
int color[maxn];
bool vis[maxn][6];//第i个结点禁用颜色j
int ans,cnt;
bool flag;

void put(int u,int cor)
{
    color[u]=cor;
    for(int i=0;i<G[u].size();i++){
        int v=G[u][i];
        vis[v][cor]=1;
    }
}

void remov(int u,int cor)
{
    color[u]=0;
    for(int i=0;i<G[u].size();i++){
        int v=G[u][i];
        vis[v][cor]=0;
    }
}

void dfs(int u)
{
    if(flag) return;
    if(color[u]) return;
    if(u==N+1){
        ans=cnt;
        flag=1;return;
    }
    for(int i=1;i<=4;i++){
        if(!vis[u][i]){
            put(u,i);
            bool tag=0;
            if(i>cnt){
                tag=1;
                cnt++;
            }
            dfs(u+1);
            remov(u,i);
            if(tag) cnt--;
        }
    }
}

int main()
{
    while(cin>>N,N){
        for(int i=1;i<=N;i++) G[i].clear();
        getchar();
        for(int u=1;u<=N;u++){
            char ch;
            cin>>ch>>ch;
            while((ch=getchar())!=‘\n‘) G[u].push_back(ch-‘A‘+1);
        }
        ans=cnt=0;
        flag=0;
        memset(color,0,sizeof(color));
        memset(vis,0,sizeof(vis));
        dfs(1);
        if(ans==1) printf("1 channel needed.\n");
        else printf("%d channels needed.\n",ans);
    }
    return 0;
}

poj_1129_dfs

poj1129——dfs，四色问题

标签：

原文地址：http://www.cnblogs.com/--560/p/4337404.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行