Submission #65656868

---

Source Code Expand

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

int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
char ch[4] = {'<','>','^','v'};

int n, m, d[1005][1005];
char dt[1005][1005];
queue <int> qx, qy;
int main()
{
	cin >> n >> m;
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= m; j++) {
			cin >> dt[i][j];
			if (dt[i][j] == 'E') {
				d[i][j] = 1;
				qx.push(i);
				qy.push(j);
			}
		}
	}
	while (!qx.empty()) {
		int x = qx.front(), y = qy.front();
		qx.pop(), qy.pop();
		for(int i = 0; i < 4; i++) {
			int tx = x + dx[i];
			int ty = y + dy[i];
			if (tx > 0 && tx <= n && ty > 0 && ty <= m)
				if (d[tx][ty] == 0 && dt[tx][ty] != '#') {
					d[tx][ty] = 1;
					qx.push(tx), qy.push(ty);
					dt[tx][ty] = ch[i];
				}
		}
	}
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= m; j++) {
			cout << dt[i][j];
		}
		cout << endl;
	}
	return 0;
}

Submission Info

Judge Result