# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
529670 | c28dnv9q3 | Nautilus (BOI19_nautilus) | C++17 | 1080 ms | 972 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
char grid[505][505];
bool dp[2][505][505];
int main() {
int R, C, M;
scanf("%d %d %d", &R, &C, &M);
for(int r = 0; r < R; r++) {
for(int c = 0; c < C; c++) {
for(grid[r][c] = getchar(); grid[r][c] != '.' && grid[r][c] != '#'; grid[r][c] = getchar());
dp[0][r][c] = (grid[r][c] == '.');
}
}
int g = 1, pg = 0;
for(int i = 0; i < M; i++) {
char m;
for(m = getchar();
m != 'N' &&
m != 'E' &&
m != 'S' &&
m != 'W' &&
m != '?'
; m = getchar());
for(int r = 0; r < R; r++) {
for(int c = 0; c < C; c++) {
dp[g][r][c] = false;
if(grid[r][c] != '.') continue;
if((m == '?' || m == 'N') && r < R-1) dp[g][r][c] |= dp[pg][r+1][c];
if((m == '?' || m == 'E') && c > 0) dp[g][r][c] |= dp[pg][r][c-1];
if((m == '?' || m == 'S') && r > 0) dp[g][r][c] |= dp[pg][r-1][c];
if((m == '?' || m == 'W') && c < C-1) dp[g][r][c] |= dp[pg][r][c+1];
}
}
pg = g;
g = (g+1) % 2;
}
int pc = 0;
for(int r = 0; r < R; r++) {
for(int c = 0; c < C; c++) {
if(dp[pg][r][c]) pc++;
}
}
printf("%d\n", pc);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |