oj.uz

Submission #813529

# Submission time Handle Problem Language Result Execution time Memory
813529 2023-08-07T19:42:30 Z bane Nautilus (BOI19_nautilus) C++17
66 / 100
 1000 ms 14336 KB 
#include<bits/stdc++.h>

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;


const int nax = 501;
char grid[nax][nax];

vector<vector<vector<int>>>dp(nax,vector<vector<int>>(nax,vector<int>(2, 0)));

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, m, k;
    cin >> n >> m >> k;
    for (int i = 0; i < n; i++){
        for (int j = 0; j < m; j++){
            cin >> grid[i][j];
        }
    }

    string s;
    cin >> s;
    for (int i = 0; i < n; i++){
        for (int j = 0; j < m; j++){
            dp[i][j][0] = (grid[i][j] == '.' ? 1 : 0);
        }
    }
    for (int t = 1; t <= k; t++){
        for (int i = 0; i < n; i++){
            for (int j = 0; j < m; j++){
                if (grid[i][j] == '#')continue;
                dp[i][j][t & 1] = 0;
                if (s[t - 1] == 'N' || s[t - 1] == '?'){
                    if (i != n - 1)dp[i][j][t & 1] |= dp[i + 1][j][!(t & 1)];
                }
                if (s[t - 1] == 'S' || s[t - 1] == '?'){
                    if (i)dp[i][j][t & 1] |= dp[i - 1][j][!(t & 1)];
                }

                if (s[t - 1] == 'E' || s[t - 1] == '?'){
                    if (j)dp[i][j][t & 1] |= dp[i][j - 1][!(t & 1)];
                }

                if (s[t - 1] == 'W' || s[t - 1] == '?'){
                    if (j != m - 1){
                        dp[i][j][t & 1] |= dp[i][j + 1][!(t & 1)];
                    }
                }
            }
        }
        
        
    }
    int ans = 0;
    for (int i = 0; i < n; i++){
        for (int j = 0; j < m; j++){
            ans += dp[i][j][k & 1];
        }
    }
    cout << ans << '\n';
}

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14036 KB Output is correct
2 Correct 16 ms 14156 KB Output is correct
3 Correct 17 ms 14072 KB Output is correct
4 Correct 17 ms 14036 KB Output is correct
5 Correct 21 ms 14160 KB Output is correct
6 Correct 13 ms 14080 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14036 KB Output is correct
2 Correct 16 ms 14156 KB Output is correct
3 Correct 17 ms 14072 KB Output is correct
4 Correct 17 ms 14036 KB Output is correct
5 Correct 21 ms 14160 KB Output is correct
6 Correct 13 ms 14080 KB Output is correct
7 Correct 15 ms 14164 KB Output is correct
8 Correct 17 ms 14036 KB Output is correct
9 Correct 17 ms 14160 KB Output is correct
10 Correct 14 ms 14168 KB Output is correct
11 Correct 12 ms 14164 KB Output is correct
12 Correct 17 ms 14164 KB Output is correct
13 Correct 16 ms 14160 KB Output is correct
14 Correct 17 ms 14164 KB Output is correct
15 Correct 14 ms 14036 KB Output is correct
16 Correct 12 ms 14036 KB Output is correct
17 Correct 17 ms 14092 KB Output is correct
18 Correct 16 ms 14164 KB Output is correct
19 Correct 16 ms 14160 KB Output is correct
20 Correct 14 ms 14072 KB Output is correct
21 Correct 12 ms 14164 KB Output is correct

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14036 KB Output is correct
2 Correct 16 ms 14156 KB Output is correct
3 Correct 17 ms 14072 KB Output is correct
4 Correct 17 ms 14036 KB Output is correct
5 Correct 21 ms 14160 KB Output is correct
6 Correct 13 ms 14080 KB Output is correct
7 Correct 15 ms 14164 KB Output is correct
8 Correct 17 ms 14036 KB Output is correct
9 Correct 17 ms 14160 KB Output is correct
10 Correct 14 ms 14168 KB Output is correct
11 Correct 12 ms 14164 KB Output is correct
12 Correct 17 ms 14164 KB Output is correct
13 Correct 16 ms 14160 KB Output is correct
14 Correct 17 ms 14164 KB Output is correct
15 Correct 14 ms 14036 KB Output is correct
16 Correct 12 ms 14036 KB Output is correct
17 Correct 17 ms 14092 KB Output is correct
18 Correct 16 ms 14164 KB Output is correct
19 Correct 16 ms 14160 KB Output is correct
20 Correct 14 ms 14072 KB Output is correct
21 Correct 12 ms 14164 KB Output is correct
22 Execution timed out 1087 ms 14336 KB Time limit exceeded
23 Halted 0 ms 0 KB -