제출 #1151948

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1151948		tnt	Nautilus (BOI19_nautilus)	C++20	66 / 100	8 ms	4932 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 = 100;
const int inf = 2e9;
int a[N + 1][N + 1][N + 1];
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;
    char b[n + 1][m + 1];
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            cin >> b[i][j];
            if(b[i][j] == '.') a[i][j][0] = 1;
        }
    }
    string g;
    cin >> g;
    for(int d = 0; d < sz; d++){
        if(g[d] == 'W'){
            for(int i = 1; i <= n; i++){
                for(int j = 1; j <= m; j++){
                    if(a[i][j][d] == 0) continue;
                    if(j != 1 && b[i][j - 1] == '.')a[i][j - 1][d + 1] = 1;
                }   
            }
        }
        else if(g[d] == 'E'){
            for(int i = 1; i <= n; i++){
                for(int j = 1; j <= m; j++){
                     if(a[i][j][d] == 0) continue;
                     if(j != m &&  b[i][j + 1] == '.')a[i][j + 1][d + 1] = 1;
                }   
            }
        }
        else if(g[d] == 'N'){
            for(int i = 1; i <= n; i++){
                for(int j = 1; j <= m; j++){
                     if(a[i][j][d] == 0) continue;
                     if(i != 1 &&  b[i - 1][j] == '.')a[i - 1][j][d + 1] = 1;
                }   
            }
        }
        else if(g[d] == 'S'){
            for(int i = 1; i <= n; i++){
                for(int j = 1; j <= m; j++){
                     if(a[i][j][d] == 0) continue;
                     if(i != n && b[i + 1][j] == '.')a[i + 1][j][d + 1] = 1;
                }   
            }
        }
        else{
            for(int i = 1; i <= n; i++){
                for(int j = 1; j <= m; j++){
                     if(a[i][j][d] == 0) continue;
                     if(i != n && b[i + 1][j] == '.')a[i + 1][j][d + 1] = 1;
                     if(j != m && b[i][j + 1] == '.')a[i][j + 1][d + 1] = 1;
                     if(i != 1 && b[i - 1][j] == '.')a[i - 1][j][d + 1] = 1;
                     if(j != 1 && b[i][j - 1] == '.')a[i][j - 1][d + 1] = 1;
                }   
            }
        }
    }
    int ans = 0;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            ans += a[i][j][sz];
        }
    }
    cout << ans;
    
}

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