Submission #1365816

---

Source Code Expand

 //ABC07 C

#include <iostream>
#include <deque>
using namespace std;


inline int getindex(int r, int c, int C) {
	return C * (r-1) + (c-1);
}



#define MAX 2500
int main()
{

	int R, C;
	int sy, sx;
	int gy, gx;

	int map[MAX];
	int *mapx[50];

	cin >> R >> C >> sy >> sx >> gy >> gx;

	for (int r = 0; r < R; r++) {
		mapx[r] = &map[C*r];
		char str[51];
		cin >> str;
		for (int c = 0; c < C; c++) {
			if (str[c] == '#')
				map[C * r + c] = -1;
			else
				map[C * r + c] = 0;
		}
	}

	//for (int r = 0; r < R; r++) {
	//	for (int c = 0; c < C; c++) {
	//		cout << mapx[r][c] << "\t";
	//	}
	//	cout << endl;
	//}

	deque<int> list;
	list.push_back(getindex(sy, sx,C));
	mapx[sy-1][sx-1] = 1;
	int golindex = getindex(gy, gx, C);
	while (list.front() != golindex)
	{
		int target = list.front();
		list.pop_front();
		int level = map[target] + 1;

			if (map[target -1] == 0) {
				list.push_back(target - 1);
				map[target -1] = level;
			}



		if (map[target + 1] == 0) {
			list.push_back(target + 1);
			map[target + 1] = level;
		}
		if (map[target - C] == 0) {
			list.push_back(target - C);
			map[target - C] = level;

		}
		if (map[target + C] == 0) {
			list.push_back(target + C);
			map[target + C] = level;
		}
	}

	cout << map[list.front()] - 1 << endl;
	/*for (int r = 0; r < R; r++) {
		for (int c = 0; c < C; c++) {
			cout << mapx[r][c] << "\t";
		}
		cout << endl;
	}
*/

	return 0;
}

Submission Info

Judge Result