Submission #3413700

---

Source Code Expand

#include <iostream>
#include <queue>
#include <utility>
using namespace std;

int R, C, sy, sx, gy, gx, d[50][50];
char c[50][50];
int dy[4] = {1, -1, 0, 0}, dx[4] = {0, 0, 1, -1};

void bfs() {
    queue<pair<int, int>> que;
    for (int i = 0; i < R; ++i) {
        for (int j = 0; j < C; ++j) d[i][j] = -1;
    }
    que.push(pair<int, int>(sy, sx));
    d[sy][sx] = 0;

    while(que.size()) {
        pair<int, int> p = que.front();
        que.pop();
        if (p.first == gy && p.second == gx) break;
        for (int i = 0; i < 4; ++i) {
            int ny = p.first + dy[i], nx = p.second + dx[i];
            if (ny >= 0 && ny < R && nx >= 0 && nx < C && c[ny][nx] != '#' && d[ny][nx] == -1) {
                que.push(pair<int, int>(ny, nx));
                d[ny][nx] = d[p.first][p.second] + 1;
            }
        }
    }
    return;
}

int main() {
    cin >> R >> C >> sy >> sx >> gy >> gx;
    --sy;
    --sx;
    --gy;
    --gx;
    for (int i = 0; i < R; ++i) {
        for (int j = 0; j < C; ++j) cin >> c[i][j];
    }
    bfs();
    cout << d[gy][gx] << endl;
    
    return 0;
}

Submission Info

Judge Result