Submission #1205986

---

Source Code Expand

#include <iostream>
#include <vector>
#include <queue>
#include <cmath>
#include <algorithm>
#include <string>
using namespace std;
using P = pair<int, int>;

constexpr int INF = 1e9;

int main() {
    int R, C;
    cin >> R >> C;
    int sy, sx, gy, gx;
    cin >> sy >> sx >> gy >> gx;
    sy--; sx--; gy--; gx--;
    vector<string> c(R);
    for(int i=0; i<R; ++i) {
        cin >> c[i];
    }
    vector<vector<int>> d(R, vector<int>(C, INF));
    queue<P> que;
    d[sy][sx] = 0;
    que.push(P{sy, sx});
    while(!que.empty()) {
        P p = que.front();
        que.pop();
        int dx[4] = {0, 1, 0, -1},
            dy[4] = {1, 0, -1, 0};
        for(int i=0; i<4; ++i) {
            int ny = p.first + dy[i], nx = p.second + dx[i];
            if(0 <= ny && ny < R && 0 <= nx && nx < C && c[ny][nx] != '#' && d[ny][nx] == INF) {
                d[ny][nx] = d[p.first][p.second] + 1;
                que.push(P{ny, nx});
            }
        }
    }
    cout << d[gy][gx] << endl;
}

Submission Info

Judge Result