Submission #6621305

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<int>> ve_vei;
typedef vector<vector<char>> ve_vec;
typedef vector<vector<string>> ve_ves;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<(int)(n);i++)
#define rep2(i,n) for(int i=2;i<(int)(n);i++)
#define repk(i,k,n) for(int i=k;i<(int)(n);i++)
#define fs first
#define sc second
#define pub push_back
#define pob pop_back
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define maxel(a) max_element(all(a))
#define acc accumulate
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define mod (1000000007)

int R,C;
char maze[50][50];
int d[50][50];
int sy,sx,gy,gx;

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


int bfs(){
    queue<i_i> que;
    rep(i,R) rep(j,C) d[i][j] = INF;
    que.push(i_i(sy,sx));
    d[sy][sx] = 0;
    while(que.size()){
        i_i p  = que.front(); que.pop();
        if(p.fs == gy and p.sc == gx) break;

        rep(i,4){
        int nx = p.sc + dx[i];
        int ny = p.fs + dy[i];
        if(0 <= nx and nx < C and 0 <= ny and ny < R ){
            if(maze[ny][nx] == '#') continue;
            if(d[ny][nx] != INF) continue;
            que.push(i_i(ny,nx));
            d[ny][nx] = d[p.fs][p.sc] + 1;
            }
        }
    }
    return d[gy][gx];
}

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

    cin >> R >> C >> sy >> sx >> gy >> gx;
    sy--, sx--,gy--,gx--; //調整
    rep(i,R) rep(j,C) cin >> maze[i][j];

    cout <<  bfs() << endl;
    return 0;
}

Submission Info

Judge Result