Submission #11370462

---

Source Code Expand

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

int R,C;
char c[51][51];
int check[51][51];
queue<pair<int,int>> que;
void search(int x,int y,int from){
    if(c[x][y]=='#' || x>=R || x<0 || y>=C || y<0)return;
    if(check[x][y]<from)return;
    check[x][y]=from;
    search(x+1,y,from+1);
    search(x-1,y,from+1);
    search(x,y+1,from+1);
    search(x,y-1,from+1);    
}


int main(){
    int i,j;
    int sx,sy;
    int gx,gy;
    cin >> R >> C;
    cin >> sx >> sy;
    cin >> gx >> gy;
    for(i=0;i<R;i++)for(j=0;j<C;j++){cin >> c[i][j]; check[i][j]=1e9;}
    search(sx-1,sy-1,0);
    cout << check[gx-1][gy-1] << endl;
}

Submission Info

Judge Result