Submission #947632

#	Time	Username	Problem	Language	Result	Execution time	Memory
947632		VMaksimoski008	Nautilus (BOI19_nautilus)	C++14	100 / 100	185 ms	604 KiB

nautilus

#include <bits/stdc++.h>
using namespace std;

bitset<500> dp[2][500], M[500];

int main() {
    int n, m, K, ans = 0, i, j, r;
    cin >> n >> m >> K;

    for(i=0; i<n; i++) {
        for(j=0; j<m; j++) {
            char ch; cin >> ch;
            M[i][j] = (ch == '.');
        }
    }

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

    for(i=0; i<n; i++)
        for(j=0; j<m; j++) dp[0][i][j] = M[i][j]; 

    for(i=1; i<=K; i++) {
        for(r=0; r<n; r++) {
            if(s[i] == 'W' || s[i] == '?') dp[1][r] |= (M[r] & (dp[0][r] >> 1));
            if(s[i] == 'E' || s[i] == '?') dp[1][r] |= (M[r] & (dp[0][r] << 1));
            if((s[i] == 'N' || s[i] == '?') && r + 1 < n) dp[1][r] |= (dp[0][r+1] & M[r]);
            if((s[i] == 'S' || s[i] == '?') && r - 1 >= 0) dp[1][r] |= (dp[0][r-1] & M[r]);
        }
        
        for(r=0; r<n; r++) {
            dp[0][r] = dp[1][r];
            dp[1][r].reset();
        }
    }

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

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