Submission #735073

---

Source Code Expand

#include <iostream>
#include <string>
#include <queue>
#include <utility>

using namespace std;


int main(void){
    int R, C;
    int sy, sx;
    int gy, gx;
    string c[50];
    int step[50][50]={{0}};
    int i;
    queue< pair<int, int> > q;

    cin >> R >> C;
    cin >> sy >> sx;
    cin >> gy >> gx;
    for (i=0; i<R; i++) {
        cin >> c[i];
    }

    q.push(pair<int, int>(sx-1, sy-1));

    while (!q.empty()) {
        int cx = q.front().first;
        int cy = q.front().second;

        if (cx==gx-1 && cy==gy-1)
            break;

        if (c[cy-1][cx] == '.') {
            q.push(pair<int, int>(cx, cy-1));
            step[cy-1][cx] = step[cy][cx] + 1;
            c[cy-1][cx] = '^';
        }
        if (c[cy][cx-1] == '.') {
            q.push(pair<int, int>(cx-1, cy));
            step[cy][cx-1] = step[cy][cx] + 1;
            c[cy][cx-1] = '^';
        }
        if (c[cy+1][cx] == '.') {
            q.push(pair<int, int>(cx, cy+1));
            step[cy+1][cx] = step[cy][cx] + 1;
            c[cy+1][cx] = '^';
        }
        if (c[cy][cx+1] == '.') {
            q.push(pair<int, int>(cx+1, cy));
            step[cy][cx+1] = step[cy][cx] + 1;
            c[cy][cx+1] = '^';
        }

        q.pop();
    }

    cout << step[gy-1][gx-1] << endl;

    return 0;
}

Submission Info

Judge Result