Submission #11349334

---

Source Code Expand

#include<iostream>
#include<string>
#include<vector>
#include <queue>
#include<math.h>
#include<algorithm>
#include <numeric>
#include <utility>

#define LL long long
#define MOD 1000000007
#define rep(i,n) for(int i = 0;i < (n);i++)

using namespace std;

LL gcd(LL C, LL D) {
	if (C < D) gcd(D, C);

	if (C%D == 0)return D;
	else gcd(D, C%D);
}


int R, C, sy, sx, gy, gx;
char c[50][50];
int dist[50][50];
queue<pair<int,int>> Q;

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

int main() {
	cin >> R >> C;
	cin >> sy >> sx;
	cin >> gy >> gx;
	sy--, sx--, gy--, gx--;

	for (int i = 0; i < R; i++) {
		for (int j = 0; j < C; j++) {
			cin >> c[i][j];
			dist[i][j] = -1;
		}
	}


	Q.push(make_pair(sy, sx));
	dist[sy][sx] = 0;

	while (!Q.empty()) {
		int y = Q.front().first;
		int x = Q.front().second;
		Q.pop();
		rep(i, 4) {
			int nx = x + dx[i], ny = y + dy[i];
			if (c[ny][nx] == '.') {
				if (dist[ny][nx] == -1) {
					dist[ny][nx] = dist[y][x] + 1;
					Q.push(make_pair(ny, nx));
				}
			}
		}
	}/*
	rep(i, R){
		rep(j, C) {
			cout << dist[i][j];
		}
		cout << endl;
	}*/
	cout << dist[gy][gx] << endl;

	return 0;

}

Submission Info

Judge Result