Submission #529660

#	Time	Username	Problem	Language	Result	Execution time	Memory
529660		c28dnv9q3	Nautilus (BOI19_nautilus)	C++17	0 / 100	4 ms	436 KiB

nautilus

#include <stdio.h>

char grid[505][505];
char path[5005];

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] == '.');
        }
    }
    for(int i = 0; i < M; i++) {
        for(path[i] = getchar();
            path[i] != 'N' &&
            path[i] != 'E' &&
            path[i] != 'S' &&
            path[i] != 'W' &&
            path[i] != '?'
        ; path[i] = getchar());
    }

    int g = 1, pg = 0;
    for(int i = M-1; i >= 0; i--) {
        char m = path[i];
        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];
                // printf("[%d: %c] %d %d -> %d\n", i, m, r, c, dp[g][r][c]);
            }
        }
        pg = g;
        g = (g+1) % 2;
    }

    int pc = 0;
    for(int r = 0; r < R; r++) {
        for(int c = 0; c < C; c++) {
            if(grid[r][c] == '.' && dp[pg][r][c]) pc++;
        }
    }
    printf("%d\n", pc);

    return 0;
}

Compilation message (stderr)

nautilus.cpp: In function 'int main()':
nautilus.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     scanf("%d %d %d", &R, &C, &M);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 29
• Subtask 2: 0 / 37
• Subtask 3: 0 / 34