Submission #1437358

---

Source Code Expand

#include <iostream>
#include <queue>

using namespace std;

const int MAX_R = 50;
const int MAX_C = 50;

int main() {
    char map[MAX_R][MAX_C];
    bool flag[MAX_R][MAX_C];
    typedef pair<int, int> P;
    queue<P> q;
    queue<int> num_q;

    int r, c;
    int sx, sy;
    int gx, gy;

    cin >> r >> c;
    cin >> sy >> sx;
    cin >> gy >> gx;

    sx--;
    sy--;
    gx--;
    gy--;

    for (int i = 0; i < r; i++) {
        for (int j = 0; j < c; j++) {
            cin >> map[i][j];
            flag[i][j] = false;
        }
    }

    q.push(P(sy, sx));
    flag[sy][sx] = true;
    num_q.push(0);
    int count;

    int dx[4] = {1, 0, -1, 0};
    int dy[4] = {0, 1, 0, -1};

    while (!q.empty()) {
        P now = q.front();
        count = num_q.front();
        q.pop();
        num_q.pop();

        if (now.first == gy && now.second == gx) {
            break;
        }

        for (int i = 0; i < 4; i++) {
            int y = now.first + dy[i];
            int x = now.second + dx[i];

            if (flag[y][x] == false && map[y][x] == '.') {
                q.push(P(y, x));
                num_q.push(count + 1);
                flag[y][x] = true;
            }
        }
    }

    cout << count << endl;

}

Submission Info

Judge Result