zoukankan      html  css  js  c++  java
  • Fire Game FZU

    Fat brother and Maze are playing a kind of special (hentai) game on an N*M board (N rows, M columns). At the beginning, each grid of this board is consisting of grass or just empty and then they start to fire all the grass. Firstly they choose two grids which are consisting of grass and set fire. As we all know, the fire can spread among the grass. If the grid (x, y) is firing at time t, the grid which is adjacent to this grid will fire at time t+1 which refers to the grid (x+1, y), (x-1, y), (x, y+1), (x, y-1). This process ends when no new grid get fire. If then all the grid which are consisting of grass is get fired, Fat brother and Maze will stand in the middle of the grid and playing a MORE special (hentai) game. (Maybe it’s the OOXX game which decrypted in the last problem, who knows.)

    You can assume that the grass in the board would never burn out and the empty grid would never get fire.

    Note that the two grids they choose can be the same.

    Input

    The first line of the date is an integer T, which is the number of the text cases.

    Then T cases follow, each case contains two integers N and M indicate the size of the board. Then goes N line, each line with M character shows the board. “#” Indicates the grass. You can assume that there is at least one grid which is consisting of grass in the board.

    1 <= T <=100, 1 <= n <=10, 1 <= m <=10

    Output

    For each case, output the case number first, if they can play the MORE special (hentai) game (fire all the grass), output the minimal time they need to wait after they set fire, otherwise just output -1. See the sample input and output for more details.

    Sample Input

    4
    3 3
    .#.
    ###
    .#.
    3 3
    .#.
    #.#
    .#.
    3 3
    ...
    #.#
    ...
    3 3
    ###
    ..#
    #.#

    Sample Output

    Case 1: 1
    Case 2: -1
    Case 3: 0
    Case 4: 2

    #include<iostream>
    #include<algorithm>
    #include<cstring>
    #include<queue>
    #include<stack>
    #include<stdio.h> 
    using namespace std;
    //两点bfs 
    const int INF = 0x3f3f3f3f;
    int n, m;
    char s[15][15];
    int vis[15][15];
    int to[4][2] = { 0,1,0,-1,1,0,-1,0 };
    struct Node {
        int x, y, step;
    }w[100];
    int bfs(Node a, Node b) {
        queue<Node>q;
        q.push(a);
        q.push(b);
        vis[a.x][a.y] = 1;
        vis[b.x][b.y] = 1;
        int cnt = 0;
        while (!q.empty()) {
            a = q.front();
            q.pop();
            cnt = max(cnt, a.step);
            for (int i = 0; i<4; i++) {
                b.x = a.x + to[i][0];
                b.y = a.y + to[i][1];
                b.step = a.step + 1;
                if (b.x >= 0 && b.y >= 0 && b.x<n&&b.y<m && !vis[b.x][b.y] && s[b.x][b.y] == '#') {
                    q.push(b);
                    vis[b.x][b.y] = 1;
                }
            }
        }
        return cnt;
    }
    int main() {
        int cnt = 0, t;
        scanf("%d", &t);
        for (cnt = 1; cnt <= t; cnt++) {
            int i, j, k, l, sum = 0;
            scanf("%d%d", &n, &m);
            for (i = 0; i<n; i++) {
                scanf("%s", s[i]);
                for (j = 0; j<m; j++) {
                    if (s[i][j] == '#') {
                        w[sum].x = i, w[sum].y = j, w[sum++].step = 0;
                    }
                }
            }
            if (sum<2)printf("Case %d: 0
    ", cnt);
            else {
                int ans = INF;
                for (int i = 0; i<sum; i++) {
                    for (j = i; j<sum; j++) {
                        memset(vis, 0, sizeof(vis));
                        int c = bfs(w[i], w[j]);
                        int flag = 0;
                        for (k = 0; k<n; k++) {
                            for (l = 0; l<m; l++) {
                                if (s[k][l] == '#' && !vis[k][l]) {
                                    flag = 1;
                                    break;
                                }
                            }
                            if (flag)break;
                        }
                        if (!flag)ans = min(ans, c);
                    }
                }
                if (ans == INF)printf("Case %d: -1
    ", cnt);
                else printf("Case %d: %d
    ", cnt, ans);
            }
        }
    }
  • 相关阅读:
    SVN服务器搭建和使用(二)
    Unity5自动命名Assetbundle并打包
    Unity学习(六)5.x依赖打包
    Dota2技能系统设计分析
    android调用其他apk的activity
    Android 跨应用调用Activity
    Unity5的AssetBundle的一点使用心得
    Myeclipse快捷键集合
    我的CSS命名规则
    常用的 Windows 键
  • 原文地址:https://www.cnblogs.com/CuteAbacus/p/9492175.html
Copyright © 2011-2022 走看看