#define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <utility>
#include <complex>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <tuple>
#include <bitset>
#include <limits>
#include <algorithm>
#include <array>z
#include <random>
#include <complex>
#include <regex>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef complex<ld> compd;
#define quickIO()	{cin.tie(0);	cout.sync_with_stdio(false);}
#define reach(i,a)	for(auto i:a)
#define rep(i,n)	for(int i=0;i<((int)n);i++)
#define REP(i,n)	for(int i=0;i<=((int)n);i++)
#define srep(i,a,n)	for(int i=a;i<((int)n);i++)
#define SREP(i,a,n)	for(int i=a;i<=((int)n);i++)
#define rrep(i,n)	for(int i=n-1;i>=0;i--)
#define RREP(i,n)	for(int i=n;i>=0;i--)
#define all(a)	(a).begin(),(a).end()
#define mp(a,b)	make_pair(a,b)
#define mt	make_tuple
#define pb	push_back
template<typename T> istream& operator >> (istream& is, vector<T>& vec) {
	for (T& x : vec)	is >> x;
	return is;
}
template<typename T> ostream& operator << (ostream& os, vector<T>& vec) {
	os << "[";
	rep(i, vec.size())	os << (i ? ", " : "") << vec[i];
	os << "]";
	return os;
}
template<typename T> istream& operator >> (istream& is, pair<T, T>& p) {
	is >> p.first >> p.second;
	return is;
}
template<typename T> ostream& operator << (ostream& os, pair<T, T>& p) {
	os << "(" << p.first << ", " << p.second << ")";
	return os;
}
int bitcnt(ll x) {
	x = ((x & 0xAAAAAAAAAAAAAAAA) >> 1) + (x & 0x5555555555555555);
	x = ((x & 0xCCCCCCCCCCCCCCCC) >> 2) + (x & 0x3333333333333333);
	x = ((x & 0xF0F0F0F0F0F0F0F0) >> 4) + (x & 0x0F0F0F0F0F0F0F0F);
	x = ((x & 0xFF00FF00FF00FF00) >> 8) + (x & 0x00FF00FF00FF00FF);
	x = ((x & 0xFFFF0000FFFF0000) >> 16) + (x & 0x0000FFFF0000FFFF);
	x = ((x & 0xFFFFFFFF00000000) >> 32) + (x & 0x00000000FFFFFFFF);
	return x;
}
int bitcnt(int x) {
	x = ((x & 0xAAAAAAAA) >> 1) + (x & 0x55555555);
	x = ((x & 0xCCCCCCCC) >> 2) + (x & 0x33333333);
	x = ((x & 0xF0F0F0F0) >> 4) + (x & 0x0F0F0F0F);
	x = ((x & 0xFF00FF00) >> 8) + (x & 0x00FF00FF);
	x = ((x & 0xFFFF0000) >> 16) + (x & 0x0000FFFF);
	return x;
}
ll sqrtll(ll x) {
	ll left = 0, right = x;
	rep(i, 100) {
		ll mid = (left + right) >> 1;
		if (mid*mid <= x)	left = mid;
		else	right = mid;
	}
	return left;
}
ll gcd(ll a, ll b) {
	return b == 0 ? a : gcd(b, a%b);
}
#define debug(x)	printf("Case #%d: ", x)
#define DEBUG 0
const ll inf = 1e18;
const ld infl = 1e100;
const ll mod = 1e9+7;
const ld eps = 1e-9;
const int dx[] = { 1,0,-1,0,0 };
const int dy[] = { 0,1,0,-1,0 };
const string dir = "ESWNX";

int H, W, T, N;
string maps[22];
vector<tuple<int, int, int>> iwashi;
int iwashiMap[22][22];
int nextIwashiMap[22][22];
double addMap[22][22];
double scoreMap[22][22];
int distanceMap[22][22];

int main() {
	cin >> H >> W >> T >> N;
	int px, py;	cin >> px >> py;
	px--;	py--;
	rep(i, H)	cin >> maps[i];
	rep(i, N) {
		int x, y, t;	cin >> x >> y >> t;
		y--;	x--;
		iwashi.push_back(mt(t, x, y));
	}
	sort(all(iwashi));
	while (get<0>(iwashi[0]) == 0) {
		int x, y, t;
		tie(t, x, y) = iwashi[0];
		cout << x << " " << y << endl;
		iwashiMap[y][x]++;
		iwashi.erase(iwashi.begin());
	}
	string ret = "";
	int score = 0;
	int paralyzed = 0;
	SREP(t, 1, T) {
		cerr << "turn:"<<t << " "<<score<<endl;
		// player move
		if (paralyzed > 0) {
			ret += "A";
		}
		else {
			rep(i, H)	rep(j, W)	scoreMap[i][j] = 0;
			rep(i, H)	rep(j, W) {
				if (maps[i][j] == '#')	continue;
				if (iwashiMap[i][j] > 0) {
					rep(y, H)	rep(x, W)	addMap[y][x] = 0;
					queue<pii> q;
					if (iwashiMap[i][j] <= 5) {
						addMap[i][j] = iwashiMap[i][j] * 2;
					}
					else {
						addMap[i][j] = -10;
					}
					q.push(mp(i, j));
					while (!q.empty()) {
						int x = q.front().second, y = q.front().first;
						q.pop();
						double val = addMap[y][x];
						rep(k, 4) {
							int nx = x + dx[k];
							int ny = y + dy[k];
							if (maps[ny][nx] == '#')	continue;
							if (addMap[ny][nx] == 0.0) {
								addMap[ny][nx] = val * 0.5;
								q.push(mp(ny, nx));
							}
						}
					}
					rep(i, H)	rep(j, W)	scoreMap[i][j] += addMap[i][j];
				}
			}
			int to = 4;
			rep(i, 4) {
				if (maps[py + dy[i]][px + dx[i]] == '#')	continue;
				if (scoreMap[py + dy[to]][px + dx[to]] - scoreMap[py + dy[i]][px + dx[i]] < eps) {
					to = i;
				}
			}
			px += dx[to];
			py += dy[to];
			ret += dir[to];
		}
		// iwashi move
		rep(i, H)	rep(j, W)	nextIwashiMap[i][j] = 0;
		rep(i, H)	rep(j, W) {
			if (maps[i][j] == '#')	continue;
			if (nextIwashiMap[i][j] > 0) {
				nextIwashiMap[i][j] += iwashiMap[i][j];
				continue;
			}
			queue<pii> q;
			rep(y, H)	rep(x, W) {
				if (maps[y][x] != '#' && iwashiMap[y][x] > 0 && !(y == i && x == j)) {
					distanceMap[y][x] = 0;
					q.push(mp(y, x));
				}
				else	distanceMap[y][x] = W * H;
			}
			if (paralyzed == 0) {
				distanceMap[py][px] = 0;
				q.push(mp(py, px));
			}
			while (!q.empty()) {
				int x = q.front().second, y = q.front().first;
				q.pop();
				rep(k, 4) {
					int nx = x + dx[k];
					int ny = y + dy[k];
					if (maps[ny][nx] == '#')	continue;
					if (distanceMap[y][x] + 1 < distanceMap[ny][nx]) {
						distanceMap[ny][nx] = distanceMap[y][x] + 1;
						q.push(mp(ny, nx));
					}
				}
			}
			rep(k, 5) {
				int ny = i + dy[k];
				int nx = j + dx[k];
				if (maps[ny][nx] == '#')	continue;
				if (distanceMap[i][j] > distanceMap[ny][nx] || k == 4) {
					nextIwashiMap[ny][nx] += iwashiMap[i][j];
					break;
				}
			}
		}
		rep(i, H)	rep(j, W)	iwashiMap[i][j] = nextIwashiMap[i][j];
		
		// iwashi つちからはえてくるんだ
		while ((!iwashi.empty()) && get<0>(iwashi[0]) == t) {
			int x, y, hogeT;
			tie(hogeT, x, y) = iwashi[0];
			iwashiMap[y][x]++;
			iwashi.erase(iwashi.begin());
		}
		// scoreing
		if (paralyzed > 0) {
			paralyzed--;
		}
		else if (0 < iwashiMap[py][px] && iwashiMap[py][px] <= 5) {
			score += iwashiMap[py][px];
			iwashiMap[py][px] = 0;
		}
		else if (iwashiMap[py][px] > 5) {
			paralyzed += 5;
			iwashiMap[py][px] = 0;
		}
	}
	cerr << "score:" << (double)score / N << endl;
	cout << ret << endl;
	return 0;
}

Battle History

ConfigScoreDate
10 x 10 tiny0.982018/11/24 07:19:58
20 x 20 little0.842018/11/24 07:19:58
20 x 20 little0.8922018/11/24 07:19:58
20 x 20 little0.6642018/11/24 07:19:58
20 x 20 little0.9282018/11/24 07:19:58
20 x 20 little0.6522018/11/24 07:19:58
20 x 20 little0.582018/11/24 07:19:58
20 x 20 much0.10733333332018/11/24 07:19:58
20 x 20 much0.081666666672018/11/24 07:19:58
20 x 20 much0.075333333332018/11/24 07:19:58
20 x 20 much0.0852018/11/24 07:19:58
20 x 20 much0.072666666672018/11/24 07:19:58
20 x 20 much0.085333333332018/11/24 07:19:58
challenge0.1612018/11/24 07:19:58
challenge0.1532018/11/24 07:19:58
challenge0.1072018/11/24 07:19:58