Submission #1137331

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <queue>
#include <map>
using namespace std;

char c[51][51];
int d[51][51];
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
typedef pair<int, int> P;
const int INF = 1 << 29;
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    int R, C;
    cin >> R >> C;

    int sy, sx;
    cin >> sy >> sx;

    int gy, gx;
    cin >> gy >> gx;

    for(int i = 1; i <= R; ++i){
        for(int j = 1; j <= C; ++j){
            cin >> c[j][i];
            d[j][i] = INF;
        }
    }

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

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

    return 0;
}

Submission Info

Judge Result