Submission #1364422

---

Source Code Expand

#include <iostream>
#include <queue>


#define D 4
#define W 0
#define N 1
#define E 2
#define S 3
const int dir[D+1] = {0, -1, 0, 1, 0};


int main() {

    // Input
    int R, C, sy, sx, gy, gx;
    std::cin >> R >> C >> sy >> sx >> gy >> gx;
    sy--; sx--;
    gy--; gx--;

    bool c[R][C];

    for (int j=0; j<R; j++) for(int i=0; i<C; i++) {
        char t;
        std::cin >> t;
        c[j][i] = (t == '.');
    }

    // BFS
    std::queue<int> queueY, queueX, queueM;
    bool visited[R][C] = {};
    int y, x, m;

    y = sy;
    x = sx;
    m = 0;
    visited[y][x] = true;
    queueY.push(y);
    queueX.push(x);
    queueM.push(m);

    while (! queueY.empty()) {
        y = queueY.front(); queueY.pop();
        x = queueX.front(); queueX.pop();
        m = queueM.front(); queueM.pop();

        if (y == gy && x == gx) break;
        m++;

        for (int i=0; i<D; i++) {
            int yy = y + dir[i+1];
            int xx = x + dir[i];

            if (yy > R || xx > C || ! c[yy][xx] || visited[yy][xx])
                continue;

            visited[yy][xx] = true;
            queueY.push(yy);
            queueX.push(xx);
            queueM.push(m);
        }
    }

    std::cout << m << std::endl;

    return 0;

}

Submission Info

Judge Result