zoukankan      html  css  js  c++  java
  • Fire!

    Fire!

     UVA - 11624 

    #include<iostream>
    #include<stdio.h>
    #include<algorithm>
    #include<queue>
    using namespace std;
    struct Node {
        int kind;
        int x, y;
        int step = 0;
    };
    int step;
    int n, m;
    int dir[4][2] = { 1,0,-1,0,0,1,0,-1 };
    queue<Node> q;
    char mmp[1005][1005];
    void bfs() {
    
        //初始化的时候就把fire节点和people节点push进去了
        //记得最后再把人push进去 
        while (!q.empty()) {
            Node temp = q.front();
            q.pop();
            if (temp.kind == 1) {
                //火节点
                for (int i = 0; i<4; i++) {
                    Node t;
                    t.x = temp.x + dir[i][0];
                    t.y = temp.y + dir[i][1];
                    if (t.x >= 0 && t.x<n&&t.y >= 0 && t.y<m&& (mmp[t.x][t.y] == '.' || mmp[t.x][t.y] == 'C')) {
                        t.step = temp.step + 1;
                        t.kind = 1;
                        mmp[t.x][t.y] = 'F';
                        q.push(t);
                    }
                }
            }
            else if (temp.kind == 2) {
                //人节点 
                if (temp.x == 0 || temp.y == 0 || temp.x == n-1 || temp.y == m-1) {
                    //逃出生天 
                    step = temp.step;
                    return;
                }
                for (int i = 0; i<4; i++) {
                    Node t;
                    t.x = temp.x + dir[i][0];
                    t.y = temp.y + dir[i][1];
                    if (t.x >= 0 && t.x<n&&t.y >= 0 && t.y<m&&(mmp[t.x][t.y] == '.')) {
                        mmp[t.x][t.y] = 'C';
                        t.step = temp.step + 1;
                        t.kind = 2;
                        q.push(t);
                    }
                }
            }
        }
    }
    int main() {
        int t;
        cin >> t;
        while (t--) {
            cin >> n >> m;
            step = -1;
            while (!q.empty())q.pop();
            Node people;
            for (int i = 0; i<n; i++) {
                for (int j = 0; j<m; j++) {
                    cin >> mmp[i][j];
                    if (mmp[i][j] == 'F') {
                        Node temp;
                        temp.x = i;
                        temp.y = j;
                        temp.kind = 1;
                        temp.step = 0;
                        q.push(temp);
                    }
                    else if (mmp[i][j] == 'J') {
                        mmp[i][j] = 'C';
                        people.x = i;
                        people.y = j;
                        people.step = 0;
                        people.kind = 2;
                    }
                }
            }
            q.push(people);
            bfs();
            if (step == -1) {
                cout << "IMPOSSIBLE
    ";
            }
            else {
                cout << step+1 << endl;
            }
        }
        return 0;
    }

    Joe works in a maze. Unfortunately, portions of the maze have caught on fire, and the owner of the maze neglected to create a fire escape plan. Help Joe escape the maze. Given Joe’s location in the maze and which squares of the maze are on fire, you must determine whether Joe can exit the maze before the fire reaches him, and how fast he can do it. Joe and the fire each move one square per minute, vertically or horizontally (not diagonally). The fire spreads all four directions from each square that is on fire. Joe may exit the maze from any square that borders the edge of the maze. Neither Joe nor the fire may enter a square that is occupied by a wall. Input The first line of input contains a single integer, the number of test cases to follow. The first line of each test case contains the two integers R and C, separated by spaces, with 1 ≤ R, C ≤ 1000. The following R lines of the test case each contain one row of the maze. Each of these lines contains exactly C characters, and each of these characters is one of: • #, a wall • ., a passable square • J, Joe’s initial position in the maze, which is a passable square • F, a square that is on fire There will be exactly one J in each test case. Output For each test case, output a single line containing ‘IMPOSSIBLE’ if Joe cannot exit the maze before the fire reaches him, or an integer giving the earliest time Joe can safely exit the maze, in minutes. Sample Input 2 4 4 #### #JF# #..# #..# 3 3 ### #J. #.F Sample Output 3 IMPOSSIBLE

  • 相关阅读:
    vector, list, deque的选用(vector适用少量对象,list适用大量对象),以及效率问题
    MSYS是一个小型的GNU环境,包括基本的bash,make等等,与Cygwin大致相当(双击“D:MinGWmsys1.0msys.bat”,启动MinGW终端)
    你在为谁工作(陈凯元 2005 机械工业出版社)——薪水算什么,要为自己而工作;薪水只是工作的一种回报方式
    Net Core2.0下使用Dapper
    编程思想与算法
    NET Core Hosting
    windows/Linux下设置ASP.Net Core开发环境并部署应用
    OAuth2.0
    TF-IDF模型
    每分钟达百万的数据请求
  • 原文地址:https://www.cnblogs.com/CuteAbacus/p/9492186.html
Copyright © 2011-2022 走看看