Submission #813499

#	Time	Username	Problem	Language	Result	Execution time	Memory
813499		bane	Nautilus (BOI19_nautilus)	C++17	66 / 100	1084 ms	14292 KiB

nautilus

#include<iostream>
#include<bits/stdc++.h>

#pragma GCC optimize("Ofast")
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::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    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 / 29
• Subtask 2: 37 / 37
• Subtask 3: 0 / 34