Submission #2402800

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PA;
typedef priority_queue<int, vector<int>, greater<int> > GQint;
typedef priority_queue<int> PQint;
typedef priority_queue<PA, vector<PA>, greater<PA> > GQpair;
typedef priority_queue<PA> PQpair;
typedef	set<int> Sint;
typedef	set<PA> SPA;
typedef map<int, int> MAP;
#define REP(i, a, n) for(ll i = (ll) a;i < (ll) n;i++)
#define fi first
#define se second
#define pb push_back
#define INF 1000000009
#define MOD 100000
#define MAXN 102
#define MAXR 51
#define MAXC 51

int r, c, sx, sy, gx, gy;
char C[MAXR][MAXC];
int d[MAXR][MAXC], dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

int bfs()
{
    queue<PA> que;
    que.push(PA(sx, sy));
    while(!que.empty()){
        PA p = que.front(); que.pop();
        if(p.fi == gx && p.se == gy) break;
        REP(i, 0, 4){
            int nx = p.fi + dx[i], ny = p.se + dy[i];
            if(0 < nx && nx < r - 1 && 0 < ny && ny < c - 1){
                if(d[nx][ny] == INF && C[nx][ny] == '.'){
                    que.push(PA(nx, ny));
                    d[nx][ny] = d[p.fi][p.se] + 1;
                }
            }
        }
    }
    return d[gx][gy];
}

int main()
{
    cin >> r >> c >> sx >> sy >> gx >> gy;
    sx--;sy--;gx--;gy--;
    REP(i, 0, r){
        REP(j, 0, c){
            cin >> C[i][j];
            d[i][j] = INF;
        }
    }
    d[sx][sy] = 0;
    cout << bfs() << endl;

    return 0;
}












/*
int n, m, a, b, c, d;

int main()
{
    cin >> n >> m;
    for(int i = 0;i <= n;i++){
        d = (m - i * 3) - 2 * (n - i);
        if(m - i * 3 >= 0 && d >= 0){
            if(d % 2 == 0 && n - i - d >= 0){
                printf("%d %d %d\n", n - i - d / 2, i, d / 2);
                return 0;
            }
        }
    }
    printf("-1 -1 -1\n");



    return 0;
}*/
/*













*/

Submission Info

Judge Result