Submission #1707015

---

Source Code Expand

#include <cstdio>
#include <iostream> 
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>

using namespace std;
using ll = long long;

const ll INF = 1e9;
const ll MOD = 1e9 + 7;
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };

int main()
{
	int R, C, sy, sx, gy, gx, i, j, d[51][51], y ,x;
	string c[51];
	queue<int> qy, qx;

	for (i = 0; i < 51; i++) {
		for (j = 0; j < 51; j++) {
			d[i][j] = INF;
		}
	}

	cin >> R >> C;
	cin >> sy >> sx;
	d[sy - 1][sx - 1] = 0;
	qy.push(sy - 1);
	qx.push(sx - 1);
	cin >> gy >> gx;
	for (i = 0; i < R; i++) {
		cin >> c[i];
	}

	while (1){
		y = qy.front();
		qy.pop();
		x = qx.front();
		qx.pop();

		if (y == gy - 1 && x == gx - 1) {
			cout << d[y][x] << endl;
			return 0;
		}

		if (y > 0) {
			if (d[y - 1][x] == INF && c[y - 1][x] == '.') {
				d[y - 1][x] = d[y][x] + 1;
				qy.push(y - 1);
				qx.push(x);
			}
		}
		if (x > 0) {
			if (d[y][x - 1] == INF && c[y][x - 1] == '.') {
				d[y][x - 1] = d[y][x] + 1;
				qy.push(y);
				qx.push(x - 1);
			}
		}
		if (y < R - 1) {
			if (d[y + 1][x] == INF && c[y + 1][x] == '.') {
				d[y + 1][x] = d[y][x] + 1;
				qy.push(y + 1);
				qx.push(x);
			}
		}
		if (x < C - 1) {
			if (d[y][x + 1] == INF && c[y][x + 1] == '.') {
				d[y][x + 1] = d[y][x] + 1;
				qy.push(y);
				qx.push(x + 1);
			}
		}
	}
}

Submission Info

Judge Result