Submission #1366527

---

Source Code Expand

#include <iostream>
#include <vector>
#include <queue>

using namespace std;

int dir_x(int xn, int dir) {
	if (dir < 2) {
		return xn;
	}
	if (dir == 2) {
		return xn+1;
	}
	return xn-1;
}

int dir_y(int yn, int dir) {
	if (dir > 1) {
		return yn;
	}
	if (dir == 0) {
		return yn+1;
	}
	return yn-1;
}

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

	vector< vector<int> > map(R,vector<int>(C));
	char temp;
	for (int i = 0; i < R; ++i) {
		for (int j = 0; j < C; ++j) {
			cin >> temp;
			if (temp == '#') {
				map[i][j] = 0;
			}
			else {
				if (i == sx-1 && j == sy-1) {
					map[i][j] = 1;
				}
				else if (i == gx-1 && j == gy-1) {
					map[i][j] = 3;
				}
				else {
					map[i][j] = 2;
				}
			}
		}
	}

	int msp = 0;
	bool goal = false;
	queue<int> x,y,d;
	x.push(sx-1);
	y.push(sy-1);
	d.push(0);
	int xn,yn,dn;
	while (!x.empty() && !goal) {
		xn = x.front();
		yn = y.front();
		dn = d.front() + 1;
		x.pop();
		y.pop();
		d.pop();
		for (int i = 0; !goal && i < 4; ++i) {
			int temp_x = dir_x(xn,i);
			int temp_y = dir_y(yn,i);
			if (map[temp_y][temp_x] > 1) {
				if (map[temp_y][temp_x] > 2) {
					msp = dn;
					goal = true;

				}
				else {
					map[temp_y][temp_x] = 1;
					x.push(temp_x);
					y.push(temp_y);
					d.push(dn);
				}
			}
		}

	}
	cout << msp << endl;

	return 0;
}

Submission Info

Judge Result