Submission #1419400

---

Source Code Expand

#include <iostream>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <string.h>
#include <queue>
#define _USE_MATH_DEFINES
#define LL long long
using namespace std;

int smax(int *ary) {
	int m = 0;
	for (int i = 0; i < sizeof(ary) / sizeof(ary[0]); i++)
		if (m < ary[i]) m = ary[i];
	return m;
}

int nmax(int *ary) {
	int max = 0, num;
	for (int i = 0; i < sizeof(ary) / sizeof(ary[0]); i++)
		if (max < ary[i]) {
			max = ary[i];
			num = i;
		}
	return max, num;
}

int main() {
	int h, w, sy, sx, gy, gx, cnt[50][50] = {}, num = 0;
	char c[51][51];
	cin >> h >> w >> sy >> sx >> gy >> gx;
	for (int i = 0; i < h; i++) cin >> c[i];
	sx--;
	sy--;
	gx--;
	gy--;
	int x_sarch[4] = { -1,0,1,0 },
		y_sarch[4] = { 0,-1,0,1 };
	queue<int> qx, qy;
	qx.push(sx);
	qy.push(sy);
	while (!qx.empty()) {
		for (int i = 0; i < 4; i++) {
			if (qx.front() + x_sarch[i] == gx && qy.front() + y_sarch[i] == gy) {
				cout << cnt[qy.front()][qx.front()] + 1 << endl;
				return 0;
			}
			if (c[qy.front() + y_sarch[i]][qx.front() + x_sarch[i]] == '.' 
				&& cnt[qy.front() + y_sarch[i]][qx.front() + x_sarch[i]] == 0 
				&&( qy.front() + y_sarch[i] != sy 
				|| qx.front() + x_sarch[i] != sx))
			{
				qx.push(qx.front() + x_sarch[i]);
				qy.push(qy.front() + y_sarch[i]);
				cnt[qy.front() + y_sarch[i]][qx.front() + x_sarch[i]] = cnt[qy.front()][qx.front()] + 1;
			}
		}
		qx.pop();
		qy.pop();
	}
	return 0;
}

Submission Info

Judge Result