Submission #1352754

---

Source Code Expand

#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "math.h"
#include "utility"
#include "string"
#include "map"
#include "unordered_map"
#include "iomanip"
#include "random"

using namespace std;
const long long int MOD = 1000000007;
list<long long int> Prime(int M) {
	list<long long int>P;
	P.push_back(2);
	P.push_back(3);
	for (int i = 5; i <= M; i += 6) {
		bool flag = true;
		for (auto j : P) {
			if (i%j == 0) {
				flag = false;
				break;
			}
		}
		if (flag)P.push_back(i);
		flag = true;
		for (auto j : P) {
			if ((i + 2) % j == 0) {
				flag = false;
				break;
			}
		}
		if (flag)P.push_back(i + 2);
	}
	return P;
}

long long int N, M, K, Q, W, H;
long long int ans;


int main() {
	ios::sync_with_stdio(false);
	cin >> H >> W;
	int sx, sy, gx, gy;
	cin >> sy >> sx;
	cin >> gy >> gx;
	string s[100];
	for (int i = 1; i <= H; i++) {
		cin >> s[i];
		s[i] = "#" + s[i] + "#";
	}
	for (int i = 0; i <= W + 1; i++) {
		s[0].push_back('#');
		s[H+1].push_back('#');
	}
	int d[] = { 1,0,-1,0,1 };
	int dis[100][100] = {};
	for (int i = 0; i < 100; i++) {
		for (int j = 0; j < 100; j++)dis[i][j] = 100000;
	}
	dis[sy][sx] = 0;
	queue<pair<int, int> >Q;
	Q.push({ sy,sx });
	while (!Q.empty()) {
		int cy = Q.front().first;
		int cx = Q.front().second;
		for (int i = 0; i < 4; i++) {
			if (s[cy + d[i]][cx + d[i + 1]] == '.'&&dis[cy][cx] + 1 < dis[cy + d[i]][cx + d[i + 1]]) {
				dis[cy + d[i]][cx + d[i + 1]] = dis[cy][cx] + 1;
				Q.push({ cy + d[i],cx + d[i + 1] });
			}
		}
		Q.pop();
	}
	cout << dis[gy][gx] << endl;
	return 0;
}

Submission Info

Judge Result