Fire Net

最新推荐文章于 2016-03-30 07:09:45 发布

Kinglliam

最新推荐文章于 2016-03-30 07:09:45 发布

阅读量1.5k

点赞数

CC 4.0 BY-SA版权

分类专栏： Online Judge 文章标签： each distance input output integer image

本文链接：https://blog.csdn.net/Kinglliam/article/details/709905

Online Judge 专栏收录该内容

35 篇文章

订阅专栏

本文介绍了一个算法挑战，目标是在包含墙壁的城市地图上放置尽可能多的防御塔楼，这些塔楼可以互相射击，但不能直接瞄准彼此。算法通过检查不同配置来确定最大数量的塔楼，同时确保它们不会处于同一水平或垂直线上，除非被一堵墙隔开。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Fire Net

Time limit: 1 Seconds Memory limit: 32768K
Total Submit: 4763 Accepted Submit: 1541

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 legal provided 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:

My Solution:

#include <stdio.h>

int main()
{
    int N, i, j, value, max, count;
    int mask, x, y, max_value;
    char Map[5][5];
    while(scanf("%d", &N) != EOF){
        if(!N) break;
        gets(Map[0]);
        for(i = 0; i < N; i++) gets(Map[i]);
        max_value = 1;  max = 0;    value = 1;
        for(i = 0; i <= N*N; i++)
            max_value <<= 1;
        while(value <= max_value){
            mask = 0x01;
            count = 0;
            for(i = 0; i < N; i++){
                for(j = 0; j < N; j++){
                    if(mask & value){
                        count++;
                        if(Map[i][j] == 'X')
                            goto not_find;
                        else Map[i][j] = 'B';
                    }else{
                        if(Map[i][j] != 'X')
                            Map[i][j] = '.';
                    }
                    mask <<= 1;
                }
            }
            for(i = 0; i < N; i++){
                for(j = 0; j < N; j++){
                    if(Map[i][j] == 'B'){
                        for(y = j-1; y >= 0; y--){
                            if(Map[i][y] == 'X') break;
                            else if(Map[i][y] == 'B') goto not_find;
                        }
                        for(y = j+1; y < N; y++){
                            if(Map[i][y] == 'X') break;
                            else if(Map[i][y] == 'B') goto not_find;
                        }
                        for(x = i-1; x >= 0; x--){
                            if(Map[x][j] == 'X') break;
                            else if(Map[x][j] == 'B') goto not_find;
                        }
                        for(x = i+1; x < N; x++){
                            if(Map[x][j] == 'X') break;
                            else if(Map[x][j] == 'B') goto not_find;
                        }
                    }
                }
            }
            if(max < count)
                max = count;
not_find:
            value++;
        }
        printf("%d/n", max);
    }
    return 0;
}

Runtime: 00:00.01
Run Memory: 392