Submission #691211

---

Source Code Expand

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
#include<complex>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>
#include<random>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

int INF = 1e9;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int R, C;
    cin >> R >> C;
    int sy, sx;
    cin >> sy >> sx;
    sy--; sx--;
    int gy, gx;
    cin >> gy >> gx;
    gy--; gx--;
    vector<string> board(R);
    for (int i = 0; i < R; i++) cin >> board[i];
    vector<int> d(R*C, INF);
    queue<int> que;
    que.push(sy), que.push(sx);
    d[sy*C+sx] = 0;
    while (!que.empty()) {
        int y = que.front(); que.pop();
        int x = que.front(); que.pop();
        for (int i = 0; i < 4; i++) {
            int ny = y+dy[i], nx = x+dx[i];
            if (ny < 0 || ny >= R || nx < 0 || nx >= C) continue;
            if (board[ny][nx] == '#') continue;
            if (d[ny*C+nx] > d[y*C+x]+1) {
                d[ny*C+nx] = d[y*C+x]+1;
                que.push(ny); que.push(nx);
            }
        }
    }
    cout << d[gy*C+gx] << endl;
    return 0;
}

Submission Info

Judge Result