Submission #1690733

---

Source Code Expand

#include<iostream>
#include<string>
#include<algorithm>
#include<stack>
#include<queue>
#include<utility>

using namespace std;

typedef pair<int, int > p;

int main() {

	int r, c, sy, sx, gy, gx;
	cin >> r >> c >> sy >> sx >> gy >> gx;
	sy--, sx--, gy--, gx--;
	char a[r][c];
	int inf = 111;
	int d[r][c];
	for (int i =0; i < r ; i++) {
		for (int j=0 ; j < c; j++) {
			cin >> a[i][j];
			d[i][j] = inf;
		}
	}
	//pairとqueueを用意
	
	queue <p > q;
	q.push(p(sy, sx));
	d[sy][sx] = 0;

	//
	int dy[4] = { 1,0,-1,0 }, dx[4] = { 0,1,0,-1 };
	int ny, nx;

	//探索開始
	while (q.size()!=0){
		p mypair = q.front();
		q.pop();
		if ((mypair.first == gy)&&(mypair.second == gx)) break;
		for (int i=0; i < 4; i++) {
			ny = mypair.first + dy[i];
			nx = mypair.second + dx[i];
			if ((0 <= ny) && (ny < r) && (0 <= nx) && (nx < c) && (a[ny][nx] == '.')  && (d[ny][nx] == inf)) {
				q.push(p(ny, nx));
				d[ny][nx] = d[mypair.first][mypair.second] + 1;
			}
		}
	}


	for (int i = 0; i < r; i++) {
		for (int j = 0; j < c; j++) {
			cout << d[i][j] << " ";

		}cout << endl;
	}

	cout << d[gy][gx] << endl;
	
	int stop;
	cin >> stop;

	return 0;
}

Submission Info

Judge Result