zoukankan      html  css  js  c++  java
  • (DFS)poj 1129

    Channel Allocation
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 12983   Accepted: 6649

    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. 

    Source

     

     

    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<string>
    #include<cmath>
    #include<algorithm>
    using namespace std;
    int n,colour,col[40];
    bool mp[30][30],flag;
    char s[40];
    bool check(int x)
    {
        for(int i=0;i<26;i++)
        {
            if(mp[i][x])
            {
                if(col[i]==col[x])
                    return false;
            }
        }
        return true;
    }
    void dfs(int x)
    {
        if(flag)
            return ;
        if(x==n)
        {
            flag=true;
            return ;
        }
        for(int i=1;i<=colour;i++)
        {
            col[x]=i;
            if(check(x))
                dfs(x+1);
            col[x]=0;
        }
    }
    int main()
    {
        while(scanf("%d",&n)!=EOF)
        {
            if(n==0)
                break;
            flag=false;
            memset(mp,0,sizeof(mp));
            for(int i=0;i<n;i++)
            {
                scanf("%s",s);
                int len=strlen(s);
                for(int j=2;j<len;j++)
                  mp[i][s[j]-'A']=mp[s[j]-'A'][i]=1;
            }
            for(colour=1;colour<=4;colour++)
            {
                dfs(0);
                if(flag)
                    break;
            }
            if(colour==1)
                printf("1 channel needed.
    ");
            else
                printf("%d channels needed.
    ",colour);
        }
        return 0;
    }
    

      

  • 相关阅读:
    如何在Wyn Enterprise中实现数据脱敏
    报表工具中如何在表格实现累计同比
    同一报表,根据不同条件,执行不同Sql
    报表单元格内超过一定长度显示省略号,鼠标悬浮显示全部内容
    报表实现按照天/周/月/季度/年进行快速查询,并且根据快速选择条件进行汇总统计
    典型报表设计:项目应收款统计,行分组不汇总、分组内过滤、行记录和汇总计算
    报表表格实现自定义序号
    报表中常见模糊查询实现
    如何在仪表板表格中将日期显示为文本格式?
    MySQL动态数据源的实现
  • 原文地址:https://www.cnblogs.com/water-full/p/4528104.html
Copyright © 2011-2022 走看看