Submission #11377693

---

Source Code Expand

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

int main(){
	int R,C;
	char c[51][51];
	int check[51][51];
	queue<pair<int,int>> que;
    int i,j;
    int sy,sx;
    int gy,gx;
    cin >> R >> C;
    cin >> sy >> sx;
    cin >> gy >> gx;
    for(i=0;i<C;i++)for(j=0;j<R;j++){cin >> c[i][j]; check[i][j]=1e9;}
	check[sx-1][sy-1]=0;
    que.push(pair<int,int> (sx-1,sy-1));
	while(!que.empty()){
		int x = que.front().first;
		int y = que.front().second;
		int dx[4] = {1,-1,0,0};
		int dy[4] = {0,0,1,-1};
		que.pop();
		for(i=0;i<4;i++){
			if(c[x+dx[i]][y+dy[i]]=='.' && check[x+dx[i]][y+dy[i]]>check[x][y]+1){
				check[x+dx[i]][y+dy[i]]=check[x][y]+1;
				que.push(pair<int,int> (x+dx[i],y+dy[i]));
			}
		}
	}
    cout << check[gx-1][gy-1] << endl;
}

Submission Info

Judge Result