Submission #1697920

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

char chizu[51][51] = {};
int dst[51][51] = {};
int r, c, sy, sx, gy, gx;
queue<pair<int, int>> q;

void check(int y, int x, int nst) {
    if (y > 0 && y <= r && x > 0 && x <= c && chizu[y][x] == '.' && dst[y][x] == 0) {
        dst[y][x] = nst+1;
        q.push(make_pair(y, x));
    }
    return;
}

int main() {
    cin >> r >> c >> sy >> sx >> gy >> gx;
    for (int i=1; i<=r; i++)
        for (int j=1; j<=c; j++) {
            char c;
            cin >> c;
            chizu[i][j] = c;
        }
    q.push(make_pair(sy, sx));
    dst[sy][sx] = 0;
    while(1) {
        pair<int, int> pos = q.front();
        int cy = pos.first;
        int cx = pos.second;
        int nst = dst[cy][cx];
        q.pop();
        if (cy == gy && cx == gx)
            break;
        check(cy-1, cx, nst);
        check(cy, cx-1, nst);
        check(cy+1, cx, nst);
        check(cy, cx+1, nst);
    }
    cout << dst[gy][gx] << endl;
    return 0;
}

Submission Info

Judge Result