Submission #691258

---

Source Code Expand

#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;

#define REP(i,n) for(int i=0; i<n; i++)
#define FOR(i,a,b) for(int i=a; i<=b; i++)
#define FORR(i,a,b) for (int i=a; i>=b; i--)
#define pi M_PI

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef pair<int,int> PII;

char maze[50][50];
int d[50][50] = {};
int sx, sy, gx, gy;
int r, c;

int dx[4] = {-1, 1, 0, 0}, dy[4] = {0, 0, -1, 1};

bool isin(int x, int y){
    return x>=0 && x<r && y>=0 && y<c;
}

int main(void){
    cin >> r >> c;
    cin >> sx >> sy >> gx >> gy;
    sx--; sy--; gx--; gy--;
    REP(i,r) REP(j,c) cin >> maze[i][j];

    queue<PII> q;
    q.push(PII(sx,sy));
    while(!q.empty()){
        PII p = q.front();
        q.pop();
        REP(k,4){
            int x = p.first+dx[k], y = p.second+dy[k];
            if (!isin(x,y) || d[x][y]>0 || maze[x][y]=='#') continue;
            d[x][y] = d[p.first][p.second]+1;
            q.push(PII(x,y));
        }
        if (d[gx][gy]>0)
            break;
    }

    cout << d[gx][gy] << endl;


    return 0;
}

Submission Info

Judge Result