제출 #412457

#제출 시각아이디문제언어결과실행 시간메모리
412457mbfibatNautilus (BOI19_nautilus)C++14
100 / 100
305 ms1372 KiB
#include <bits/stdc++.h>

using namespace std;

int R, C, M;
string s;

char c[501][501];
bitset<250000> org, cur, N, E, S, W;

int id(int i, int j) {
	return i * C + j;
}

int main(int argc, char** argv)
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	 
	cin >> R >> C >> M;
	for (int i = 0; i < R; i++)
		for (int j = 0; j < C; j++) {
			cin >> c[i][j];

			int pos = id(i, j);
			if (c[i][j] == '.') {
				org.set(pos);
				cur.set(pos);
			}	
			if (i != R - 1) N.set(pos);
			if (i != 0) S.set(pos);
			if (j != C - 1) W.set(pos);
			if (j != 0) E.set(pos);
		}

	cin >> s;
	for (int i = 0; i < M; i++) {
		if (s[i] == 'N')
			cur = (cur >> C) & N;	
		else if (s[i] == 'S') 	
			cur = (cur << C) & S;
		else if (s[i] == 'W')
			cur = (cur >> 1) & W;
		else if (s[i] == 'E')
			cur = (cur << 1) & E;
		else
			cur = (((cur >> C) & N) | ((cur << C) & S) | ((cur >> 1) & W) | ((cur << 1) & E));	
		cur &= org;
//		for (int j = 0; j < R; j++) {
//			for (int k = 0; k < C; k++)
//				cerr << cur[id(j, k)];
//			cerr << "\n";	
//		}
//		cerr << '\n';
	}
	cout << cur.count();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...