zoukankan      html  css  js  c++  java
  • Fire Net(深度优先搜索)

    ZOJ Problem Set - 1002
    Fire Net

    Time Limit: 2 Seconds      Memory Limit: 65536 KB

    Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall.

    A blockhouse is a small castle that has four openings through which to shoot. The four openings are facing North, East, South, and West, respectively. There will be one machine gun shooting through each opening.

    Here we assume that a bullet is so powerful that it can run across any distance and destroy a blockhouse on its way. On the other hand, a wall is so strongly built that can stop the bullets.

    The goal is to place as many blockhouses in a city as possible so that no two can destroy each other. A configuration of blockhouses is legalprovided that no two blockhouses are on the same horizontal row or vertical column in a map unless there is at least one wall separating them. In this problem we will consider small square cities (at most 4x4) that contain walls through which bullets cannot run through.

    The following image shows five pictures of the same board. The first picture is the empty board, the second and third pictures show legal configurations, and the fourth and fifth pictures show illegal configurations. For this board, the maximum number of blockhouses in a legal configuration is 5; the second picture shows one way to do it, but there are several other ways.

    Your task is to write a program that, given a description of a map, calculates the maximum number of blockhouses that can be placed in the city in a legal configuration.

    The input file contains one or more map descriptions, followed by a line containing the number 0 that signals the end of the file. Each map description begins with a line containing a positive integer n that is the size of the city; n will be at most 4. The next n lines each describe one row of the map, with a '.' indicating an open space and an uppercase 'X' indicating a wall. There are no spaces in the input file.

    For each test case, output one line containing the maximum number of blockhouses that can be placed in the city in a legal configuration.

    Sample input:

    4
    .X..
    ....
    XX..
    ....
    2
    XX
    .X
    3
    .X.
    X.X
    .X.
    3
    ...
    .XX
    .XX
    4
    ....
    ....
    ....
    ....
    0
    

    Sample output:

    5
    1
    5
    2
    4
    

    Source: Zhejiang University Local Contest 2001
     
    思路:由于数据量很少,直接执行DFS暴力搜索每一个点
     1 #include <iostream>
     2 #include <cstdio>
     3 
     4 using namespace std;
     5 
     6 const int SZ = 5;
     7 int n;
     8 char map[SZ][SZ];
     9 bool vis[SZ][SZ];
    10 
    11 int DFS(int y, int x)
    12 {
    13     if(y == n) return 0;
    14     if(map[y][x] == 'X')
    15     {
    16         if(x < n - 1) return DFS(y, x + 1);
    17         else return DFS(y + 1, 0);
    18     }
    19     bool ok = true;
    20     for(int i = x - 1; i > -1; i--)
    21     {
    22         if(map[y][i] == 'X') break;
    23         else if(vis[y][i])
    24         {
    25             ok = false;
    26             break;
    27         }
    28     }
    29     if(ok)
    30     {
    31         for(int i = y - 1; i > -1; i--)
    32         {
    33             if(map[i][x] == 'X') break;
    34             else if(vis[i][x])
    35             {
    36                 ok = false;
    37                 break;
    38             }
    39         }
    40     }
    41     if(ok)
    42     {
    43         int add0 = 0, add1 = 1;
    44         if(x == n - 1)
    45             add0 += DFS(y + 1, 0);
    46         else
    47             add0 += DFS(y, x + 1);
    48         vis[y][x] = true;
    49         if(x == n - 1)
    50             add1 += DFS(y + 1, 0);
    51         else
    52             add1 += DFS(y, x + 1);
    53         vis[y][x] = false;
    54         return add0 > add1 ? add0 : add1;
    55     }
    56     else
    57     {
    58         if(x < n - 1) return DFS(y, x + 1);
    59         else return DFS(y + 1, 0);
    60     }
    61 }
    62 
    63 int main()
    64 {
    65     char ch;
    66     while(scanf("%d", &n) && n)
    67     {
    68         for(int i = 0; i < n; i++)
    69         {
    70             scanf("%s", map[i]);
    71         }
    72         memset(vis, false, sizeof(vis));
    73         printf("%d
    ", DFS(0, 0));
    74     }
    75     return 0;
    76 }
  • 相关阅读:
    无需认证的mail,适用于ZABBIX等运维系统
    Linux交换分区使用过多的处理办法
    zookeeper的单实例和伪集群部署
    Zookeeper分布式集群原理与功能
    Nginx禁止IP直接访问网站
    镜像站地址汇总
    Nginx反向代理后端多节点下故障节点的排除思路
    Redis主从复制与高可用方案
    http_proxy_module模块常用参数
    Nginx实现负载均衡的几种方式
  • 原文地址:https://www.cnblogs.com/cszlg/p/3209364.html
Copyright © 2011-2022 走看看