Submission #3781831

---

Source Code Expand

using namespace std;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
#include <iostream>
#include <string>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cmath>
#include <climits>
#include <bitset>
#include <array>
#include <queue>
#include <typeinfo>
#define all(x) (x).begin(),(x).end()

void solve(){

}
int main(){
    int h,w;
    int sx,sy;
    int gx,gy;
    array<string, 50> ma;
    cin >> h >> w;
    cin >> sy >> sx;
    cin >> gy >> gx;
    sy -= 1;
    sx -= 1;
    gx -= 1;
    gy -= 1;

    for (int i = 0; i < h; i++){
        cin >> ma[i];
    }


    queue<int> que_x;
    queue<int> que_y;
    que_x.push(sx);
    que_y.push(sy);
    array<array<int, 50> , 50> memo;
    for (int i = 0; i < h; i++){
        for (int k = 0; k < w; k++){
            memo[i][k] = -1;
        }
    }
    memo[sy][sx] = 0;
    int cnt = 0;

    array<int, 4> dx = {1,-1,0,0};
    array<int, 4> dy = {0,0,1,-1};

    while(que_x.size() != 0 && que_y.size() != 0){
        int x = que_x.front();
        int y = que_y.front();
        //cout << "x = " << x << endl;
        //cout << "y = " << y << endl;
        que_x.pop();
        que_y.pop();

        for (int i = 0; i < 4; i++){
            int nextX = x + dx[i];
            int nextY = y + dy[i];


            if (0 <= nextX && 0 <= nextY && nextX < w && nextY < h && ma[nextY][nextX] == '.'){

                int passed = memo[nextY][nextX];
                if(passed == -1){
                    memo[nextY][nextX] = memo[y][x] + 1;
                    que_x.push(nextX);
                    que_y.push(nextY);
                }
            }
        }
    }

    for (int i = 0; i < h; i++){
        for (int k = 0; k < w; k++){
            cnt = max(memo[i][k],cnt);
        }
    }
    cout << cnt << endl;



    
    //que.push(make_pair(1,2));
    //cout << que.front().first << endl;



    return 0;
}

Submission Info

Judge Result