Submission #1438192

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <utility>
#include <functional>

using namespace std;

int main() {
	int r, c, sx, sy, gx, gy;
	char f[51][51];
	cin >> r >> c >> sy >> sx >> gy >> gx;
	for (int i = 1; i <= r; ++i) {
		for (int j = 1; j <= c; ++j) {
			cin >> f[i][j];
		}
	}

	int dx[] = { 1, 0, -1, 0 };
	int dy[] = { 0, 1, 0, -1 };

	queue<pair<int, int>> que;
	que.push(make_pair(sy, sx));
	bool visit[51][51] = { false }, finish = false;
	int ans = 0;
	while (!que.empty()) {
		for (int i = 0, size = que.size(); i < size; ++i) {
			auto tmp = que.front();
			que.pop();

			if (tmp.first == gy && tmp.second == gx) {
				finish = true;
				break;
			}

			for (int j = 0; j < 4; ++j) {
				int ny = tmp.first + dy[j];
				int nx = tmp.second + dx[j];
				if (ny < 1 || ny > r || nx < 1 || nx > c || f[ny][nx] == '#' || visit[ny][nx]) {
					continue;
				}
				visit[ny][nx] = true;
				que.push(make_pair(ny, nx));
			}
		}
		if (finish) {
			break;
		}

		ans++;
	}

	cout << ans << endl;

	return 0;
}

Submission Info

Judge Result