Submission #1211100

#	Time	Username	Problem	Language	Result	Execution time	Memory
1211100		dwuy	Nautilus (BOI19_nautilus)	C++20	0 / 100	1 ms	324 KiB

nautilus

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

const int MX = 505;
int n, m, k;
string s;
string a[MX];
bitset<MX> b[MX];
bitset<MX> vist[2][MX];

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> n >> m >> k;
    for(int i=1; i<=n; i++){
        cin >> a[i];
        a[i] = ' ' + a[i];
        for(int j=1; j<=m; j++) b[i][j] = a[i][j] == '.';
        vist[1][i] = b[i];
    }
    cin >> s;

    for(int i=0; i<k; i++){
        int t = i&1;
        if(s[i] == 'E' || s[i] == '?') {
            for(int i=1; i<=n; i++){
                vist[t][i] = vist[t][i] | (vist[!t][i] >> 1);
            }
        }
        if(s[i] == 'W' || s[i] == '?'){
            for(int i=1; i<=n; i++){
                vist[t][i] = vist[t][i] | (vist[!t][i] << 1);
            }    
        }
        if(s[i] == 'S' || s[i] == '?'){
            for(int i=1; i<n; i++){
                vist[t][i + 1] = vist[t][i + 1] | vist[!t][i];
            }
        }
        if(s[i] == 'N' || s[i] == '?'){
            for(int i=1; i<n; i++){
                vist[t][i] = vist[t][i] | vist[!t][i + 1];

            }
        }
        for(int i=1; i<=n; i++){
            vist[t][i] = vist[t][i] & b[i];
            vist[!t][i] = 0;
        }
    }

    int ans = 0;
    for(int i=1; i<=n; i++){
        ans += vist[(k - 1)&1][i].count();
    }

    cout << ans;

    return 0;
}

/*

4 3 2
...
.#.
.#.
...
DN

*/

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