Submission #3429575

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) REP(i, 0, n)
#define REP(i, k, n) for(auto i = k; i != n; i++)
#define rrep(i, n) RREP(i, n, 0)
#define RREP(i, n, k) for(auto i = n; i != k; i--)
#define all(x, r) (x), (x)+(r)
#define ALL(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << " " << x << endl
#define exst(x, data) (data).find(x) != (data).end()
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define np next_permutation
#define b32 bitset<32>

using ll = long long;
using Pii = pair<int,int>;
using Tiii = tuple<int, int, int>;
template<class T>using V = vector<T>;

const int dx[4] = {1, -1, 0, 0}, dy[4] = {0, 0, 1, -1};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    int R, C; cin >> R >> C;
    int sy, sx, gy, gx; cin >> sy >> sx >> gy >> gx;
    Tiii s = mt(sy,sx,0);

    char c[53][53]; memset(c, '#', sizeof(c));
    bool closed[53][53] = {false};

    REP(i,1,R+1) REP(j,1,C+1) cin >> c[i][j];

    int ans;
    queue<Tiii> que;
    que.push(s);
    while(!que.empty()) {
        int y, x, t; tie(y,x,t) = que.front(); que.pop();
        if(closed[y][x]) continue;
        closed[y][x] = true;
        if(y==gy && x==gx) {
            ans = t;
            break;
        }
        rep(i,4) {
            if(!closed[y+dy[i]][x+dx[i]] && c[y+dy[i]][x+dx[i]] == '.')
                que.push(mt(y+dy[i],x+dx[i],t+1));
        }
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result