Submission #791902

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
#define ITR(i,c) for(auto i=begin(c);i!=end(c);i++)
#define FOR(i,a,n) for(int i=a;i<(int)(n);i++)
#define FORR(x,arr) for(auto& x:arr)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) begin(c),end(c)
#define PB push_back
#define MP make_pair
const int DX[4]={0,1,0,-1}, DY[4]={-1,0,1,0};
const int INF = 1e9;

struct P {
    int x;
    int y;
    int d;
};
int main(int argc, char const *argv[]) {
    int r,c,sx,sy,gx,gy;
    cin >> r >> c >> sy >> sx >> gy >> gx;
    vector<string> b(r);
    REP(i,r) {
        cin >> b[i];
    }

    queue<P> q;
    P start;
    start.x = sx-1; start.y = sy-1; start.d = 0;
    q.push(start);
    b[start.y][start.x]='#';
    while(!q.empty()) {
        P p = q.front(); q.pop();
        if(p.x == gx-1 && p.y == gy-1) {
            cout << p.d << endl;
            return 0;
        }

        REP(i,4) {
            P np;
            np.x = p.x + DX[i];
            np.y = p.y + DY[i];
            np.d = p.d + 1;
            if(np.x < 0 || np.x >= c || np.y < 0 || np.y >= r) continue;
            if(b[np.y][np.x]=='.') {
                q.push(np);
                b[np.y][np.x]='#';
            }
        }
    }
    return 0;
}

Submission Info

Judge Result