Submission #1151975

#	Time	Username	Problem	Language	Result	Execution time	Memory
1151975		tnt	Nautilus (BOI19_nautilus)	C++20	100 / 100	108 ms	1544 KiB

nautilus

#include <bits/stdc++.h>
using namespace std;
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")

#define pb push_back                    
#define ll long long
#define sz(s) int(s.size()
#define all(v) v.begin(),v.end()

int mod = 1e8;
const int N = 500 + 10;
const int inf = 2e9;
int a[N][N];
bitset <510> b[N],b1[N],h[N];
signed main(){
    //freopen("shuffle.in", "r", stdin);
    //freopen("shuffle.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n,m,sz;
    cin >> n >> m >> sz;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            char c;
            cin >> c;
            if(c == '.') a[i][j] = 1;
            b[i][j] = a[i][j];
        }
        h[i] = b[i];
    } 
    string s;
    cin >> s;
    for(int st = 0; st < sz; st++){
        if(s[st] == 'W'){
            for(int i = 1; i <= n; i++){
                b1[i] = (b[i] >> 1);
                b1[i] &= h[i];
            }
        }
        else if(s[st] == 'E'){
            for(int i = 1; i <= n; i++){
                b1[i] = (b[i] << 1);
                b1[i] &= h[i];
            }
        }
        else if(s[st] == 'N'){
            for(int i = 1; i <= n; i++){
                b1[i] = b[i + 1];
                b1[i] &= h[i];
            }
        }
        else if(s[st] == 'S'){
            for(int i = n; i >= 1; i--){
                b1[i] = b[i - 1];
                b1[i] &= h[i];
            }
        }
        else{
            for(int i = 1; i <= n; i++){
                b1[i] = ((b[i] << 1) | (b[i] >> 1) | (b[i - 1] | b[i + 1]));
                b1[i] &= h[i];
            }  
        }
        for(int i = 1; i <= n; i++){
            b[i] = b1[i];
        }
    }
    int ans = 0;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            ans += b[i][j];
        }
    }
    cout << ans;
    
}

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