zoukankan      html  css  js  c++  java
  • POJ 3020, Antenna Placement

    Time Limit: 1000MS  Memory Limit: 65536K
    Total Submissions: 2236  Accepted: 1038


    Description
    The Global Aerial Research Centre has been allotted the task of building the fifth generation of mobile phone nets in Sweden. The most striking reason why they got the job, is their discovery of a new, highly noise resistant, antenna. It is called 4DAir, and comes in four types. Each type can only transmit and receive signals in a direction aligned with a (slightly skewed) latitudinal and longitudinal grid, because of the interacting electromagnetic field of the earth. The four types correspond to antennas operating in the directions north, west, south, and east, respectively. Below is an example picture of places of interest, depicted by twelve small rings, and nine 4DAir antennas depicted by ellipses covering them. 
     
    Obviously, it is desirable to use as few antennas as possible, but still provide coverage for each place of interest. We model the problem as follows: Let A be a rectangular matrix describing the surface of Sweden, where an entry of A either is a point of interest, which must be covered by at least one antenna, or empty space. Antennas can only be positioned at an entry in A. When an antenna is placed at row r and column c, this entry is considered covered, but also one of the neighbouring entries (c+1,r),(c,r+1),(c-1,r), or (c,r-1), is covered depending on the type chosen for this particular antenna. What is the least number of antennas for which there exists a placement in A such that all points of interest are covered?


    Input
    On the first row of input is a single positive integer n, specifying the number of scenarios that follow. Each scenario begins with a row containing two positive integers h and w, with 1 <= h <= 40 and 0 < w <= 10. Thereafter is a matrix presented, describing the points of interest in Sweden in the form of h lines, each containing w characters from the set ['*','o']. A '*'-character symbolises a point of interest, whereas a 'o'-character represents open space.


    Output
    For each scenario, output the minimum number of antennas necessary to cover all '*'-entries in the scenario's matrix, on a row of its own.

     

    Sample Input
    2
    7 9
    ooo**oooo
    **oo*ooo*
    o*oo**o**
    ooooooooo
    *******oo
    o*o*oo*oo
    *******oo
    10 1
    *
    *
    *
    o
    *
    *
    *
    *
    *
    *

    Sample Output
    17
    5

    Source
    Svenskt Mästerskap i Programmering/Norgesmesterskapet 2001


    // POJ3020.cpp : Defines the entry point for the console application.
    //

    #include 
    <iostream>
    #include 
    <map>
    using namespace std;

    bool DFS(int k, bool d[451][451], bool visited[451], int match[451], int n)
    {
        
    for (int j = 0; j < n; ++j)
            
    if (visited[j]==false && d[k][j] == true)
            {
                visited[j] 
    = true;
                
    if (match[j] == -1 || DFS(match[j],d,visited,match,n))
                {
                    match[j] 
    = k;
                    
    return true;
                }
            };
        
    return false;
    }

    int main(int argc, char* argv[])
    {
        
    int cases;
        cin 
    >> cases;

        
    int h, w;
        
    char map[41][11];
        
    int im[41][11];
        
    bool d[451][451];
        
    int walk[4][2]={-1001100-1};

        
    bool visited[451];
        
    int match[451];
        
    for (int c = 0; c < cases; ++c)
        {
            scanf(
    "%d %d\n",&h, &w);
            
    for (int i = 0; i < h; ++i)gets(map[i]);

            
    int cnt = 0;
            
    for (int i = 0; i < h; ++i)
                
    for (int j = 0; j < w; ++j)
                    im[i][j] 
    = map[i][j] == '*' ? cnt++:-1;

            memset(d, 
    0sizeof(d));
            
    for (int i = 0; i < h; ++i)
                
    for (int j = 0; j < w; ++j)
                    
    if (im[i][j] != -1)
                        
    for(int k = 0; k < 4++k)
                        {
                            
    int y = i + walk[k][0];
                            
    int x = j + walk[k][1];
                            
    if (x >= 0 && x < w && y >= 0 && y < h && im[y][x] != -1) d[im[i][j]][im[y][x]] = true;
                        };

            
    int result = 0;
            memset(match, 
    -1sizeof(match));
            
    for (int i = 0; i < cnt; ++i)
            {
                memset(visited, 
    0sizeof(visited));
                
    if (DFS(i,d,visited,match,cnt)) ++ result;
            }

            cout 
    << cnt - (result >> 1<< endl;
        }
        
    return 0;
    }

  • 相关阅读:
    测试面试题集-接口测试(9)
    测试面试题集-性能测试(8)
    测试面试题集-网络基础(7)
    测试面试题集-Python编程题(6)
    测试面试题集-Python列表去重(5)
    测试面试题集-生活物品测试:杯子、伞、钢笔、桌子、行李箱、电梯、洗衣机(4)
    测试面试题集-测试用例设计(3)
    测试面试题集-测试基础理论(2)
    解决在docker环境中拉取svn项目中含有中文名称的文件时拉取失败的问题
    redisTemplate之opsForHash()用法分析
  • 原文地址:https://www.cnblogs.com/asuran/p/1578674.html
Copyright © 2011-2022 走看看