Submission #1478031

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int dy[4] = {-1,0,1,0};
int dx[4] = {0,-1,0,1};
int main(){
	int n,m,sy,sx,gy,gx;
	cin >> n >> m >> sy >> sx >> gy >> gx;
	char c[n][m];
	int  ans[n][m] = {0};
	for(int i = 0; i < n; i++)
		for(int j = 0; j < m; j++)
			cin >> c[i][j];
	queue <pair <int, int > > que;
	que.push(make_pair(sy - 1,sx - 1));
	int d= 0;
	ans[sy - 1][sx - 1] = 0;
	c[sy - 1][sx - 1] = '#';
	while(!que.empty()){
		int y = que.front().first,
			x = que.front().second;
		que.pop();
		if(x == gx-1 && y == gy-1){
			cout << ans[y][x] << endl;
			break;
		}
		for(int i = 0; i < 4; i++){
			if(c[y + dy[i]][x + dx[i]] == '.'){
				que.push(make_pair(y + dy[i],x + dx[i]));
				c[y + dy[i]][x + dx[i]] = '#';
				ans[y + dy[i]][x + dx[i]] = ans[y][x] + 1;
			}
		}
	}
}

Submission Info

Judge Result