Submission #691250

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
typedef pair<int,int> pii;

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

struct node {
	int y, x, c;
	node(int yy, int xx, int cc) {
		y = yy;
		x = xx;
		c = cc;
	}
};

int main() {
	int r, c;
	cin >> r >> c;
	bool pass[52][52] = {};
	int visit[52][52] = {};
	int sx, sy, gx, gy;
	cin >> sy >> sx >> gy >> gx;
	rep(y, r) {
		string s;
		cin >> s;
		rep(x, c) {
			pass[y+1][x+1] = (s[x] == '.');
		}
	}

	queue<node> que;
	que.push(node(sy, sx, 0));
	while(!que.empty()) {
		node p = que.front();
		que.pop();
		if( visit[p.y][p.x] > 0 ) {
			continue;
		}
		visit[p.y][p.x] = p.c;
		if( p.y == gy && p.x == gx ) {
			cout << p.c << endl;
			break;
		}
		rep(i, 4) {
			int nx = p.x + dx[i];
			int ny = p.y + dy[i];
			if( visit[ny][nx] == 0 && pass[ny][nx] ) {
				que.push(node(ny, nx, p.c+1));
			}
		}
	}
	return 0;
}

Submission Info

Judge Result