oj.uz

Submission #947596

# Submission time Handle Problem Language Result Execution time Memory
947596 2024-03-16T14:29:02 Z VMaksimoski008 Nautilus (BOI19_nautilus) C++14
66 / 100
 1000 ms 920 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
using namespace std;

int32_t main() {
    int n, m, K, ans = 0;
    cin >> n >> m >> K;

    char mat[n][m];
    for(int i=0; i<n; i++) 
        for(int j=0; j<m; j++) cin >> mat[i][j];

    string s;
    cin >> s;
    s = "." + s;

    bool dp[2][n][m];
    memset(dp, 0, sizeof(dp));
    for(int i=0; i<n; i++)
        for(int j=0; j<m; j++) dp[0][i][j] = (mat[i][j] == '.');

    for(int i=1; i<=K; i++) {
        for(int r=0; r<n; r++) {
            for(int c=0; c<m; c++) {
                dp[1][r][c] = 0;
                if(mat[r][c] == '#') continue;
                if((s[i] == 'W' || s[i] == '?') && c + 1 < m && dp[0][r][c+1]) dp[1][r][c] = 1;
                if((s[i] == 'E' || s[i] == '?') && c - 1 >= 0 && dp[0][r][c-1]) dp[1][r][c] = 1;
                if((s[i] == 'N' || s[i] == '?') && r + 1 < n && dp[0][r+1][c]) dp[1][r][c] = 1;
                if((s[i] == 'S' || s[i] == '?') && r - 1 >= 0 && dp[0][r-1][c]) dp[1][r][c] = 1;
            }
        }

        for(int r=0; r<n; r++)
            for(int c=0; c<m; c++) dp[0][r][c] = dp[1][r][c];
    }

    for(int i=0; i<n; i++)
        for(int j=0; j<m; j++) ans += dp[0][i][j];
    cout << ans << '\n';
    return 0;
}

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 348 KB Output is correct
2 Correct 4 ms 348 KB Output is correct
3 Correct 7 ms 348 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 348 KB Output is correct
2 Correct 4 ms 348 KB Output is correct
3 Correct 7 ms 348 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 4 ms 344 KB Output is correct
8 Correct 9 ms 348 KB Output is correct
9 Correct 6 ms 348 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 5 ms 348 KB Output is correct
13 Correct 9 ms 348 KB Output is correct
14 Correct 11 ms 348 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 3 ms 348 KB Output is correct
17 Correct 5 ms 348 KB Output is correct
18 Correct 10 ms 452 KB Output is correct
19 Correct 9 ms 344 KB Output is correct
20 Correct 3 ms 348 KB Output is correct
21 Correct 2 ms 604 KB Output is correct

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 348 KB Output is correct
2 Correct 4 ms 348 KB Output is correct
3 Correct 7 ms 348 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 4 ms 344 KB Output is correct
8 Correct 9 ms 348 KB Output is correct
9 Correct 6 ms 348 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 5 ms 348 KB Output is correct
13 Correct 9 ms 348 KB Output is correct
14 Correct 11 ms 348 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 3 ms 348 KB Output is correct
17 Correct 5 ms 348 KB Output is correct
18 Correct 10 ms 452 KB Output is correct
19 Correct 9 ms 344 KB Output is correct
20 Correct 3 ms 348 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Execution timed out 1059 ms 920 KB Time limit exceeded
23 Halted 0 ms 0 KB -