Submission #920953

---

Source Code Expand

#include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) for(int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define debug(x) cout << "debug " << x << endl;
#define INF (1 << 29)
using namespace std;

const int N = 50;

struct point{ int x, y; };
int dy[4] = {0,1,0,-1}, dx[4] = {1,0,-1,0};

int bfs(bool M[N][N], int h, int w, int sy, int sx, int gy, int gx){
    int dis[N][N];
    queue<point> q;
    rep(i,N) rep(j,N) dis[i][j] = INF;
    point start_coordinate = {sx, sy};

    dis[start_coordinate.y][start_coordinate.x] = 0;
    q.push(start_coordinate);

    point u;
    while(!q.empty()){
        u = q.front(); q.pop();
        rep(i,4){
            point next;
            next.x = u.x + dx[i];
            next.y = u.y + dy[i];
            if(dis[next.y][next.x] == INF && M[next.y][next.x] == 0){
                dis[next.y][next.x] = dis[u.y][u.x] + 1;
                q.push(next);
            }
        }
    }
    return dis[gy][gx];
}

int main(){
    int h, w, sy, sx, gy, gx;
    bool M[N][N];
    cin >> h >> w >> sy >> sx >> gy >> gx;
    sy--; sx--; gy--; gx--;
    rep(i,h){
        rep(j,w){
            char inp;
            cin >> inp;
            if(inp == '#') M[i][j] = 1;
            else M[i][j] = 0;
        }
    }

    cout << bfs(M, h, w, sy, sx, gy, gx) << endl;
}

Submission Info

Judge Result