Submission #1815821

---

Source Code Expand

#include <bits/stdc++.h>

#define INF 1000000

using namespace std;

int main()
{
    int R, C, sy, sx, gy, gx, k[51][51], i, j, y, x;
    char c[51][51];
    queue<pair<int, int>> q;

    for(i = 0; i < 51; i++){
        for(j = 0; j < 51; j++){
            k[i][j] = INF;
        }
    }

    cin >> R >> C >> sy >> sx >> gy >> gx;
    for(i = 0; i < R; i++){
        for(j = 0; j < C; j++){
            cin >> c[i][j];
        }
    }
    k[sy - 1][sx - 1] = 0;
    q.push(make_pair(sy - 1, sx - 1));

    while(!q.empty()){
        y = q.front().first;
        x = q.front().second;
        q.pop();
        if(y == gy - 1 && x == gx - 1){
            break;
        }
        if(x > 0 && c[y][x - 1] == '.' && k[y][x - 1] == INF){
            q.push(make_pair(y, x - 1));
            k[y][x - 1] = k[y][x] + 1;
        }
        if(x < C - 1 && c[y][x + 1] == '.' && k[y][x + 1] == INF){
            q.push(make_pair(y, x + 1));
            k[y][x + 1] = k[y][x] + 1;
        }
        if(y > 0 && c[y - 1][x] == '.' && k[y - 1][x] == INF){
            q.push(make_pair(y - 1, x));
            k[y - 1][x] = k[y][x] + 1;
        }
        if(y < R - 1 && c[y + 1][x] == '.' && k[y + 1][x] == INF){
            q.push(make_pair(y + 1, x));
            k[y + 1][x] = k[y][x] + 1;
        }
    }

    cout << k[y][x] << endl;
}

Submission Info

Judge Result