제출 #489137

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
489137		ak2006	Nautilus (BOI19_nautilus)	C++14	66 / 100	118 ms	262148 KiB

nautilus

#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#pragma GCC optimize("Ofast")
int main()
{
    fast;

    int r,c,m;
    cin>>r>>c>>m;
    char g[r + 1][c + 1];
    bool dp[r + 2][c + 2][m + 1];
    memset(dp,false,sizeof(dp));
    for (int i = 1;i<=r;i++)
        for (int j = 1;j<=c;j++)
            cin>>g[i][j],dp[i][j][0] = (g[i][j] != '#');
    string s;
    cin>>s;
    int ans = 0;
    for (int t = 1;t<=m;t++){
        for (int i = 1;i<=r;i++){
            for (int j = 1;j<=c;j++){
                if (g[i][j] == '#')continue;
                if (s[t - 1] == 'E')
                    dp[i][j][t] = dp[i][j - 1][t - 1];
                else if (s[t - 1] == 'W')
                    dp[i][j][t] = dp[i][j + 1][t - 1];
                else if (s[t - 1] == 'N')
                    dp[i][j][t] = dp[i + 1][j][t - 1];
                else if (s[t - 1] == 'S')
                    dp[i][j][t] = dp[i - 1][j][t - 1];
                else dp[i][j][t] = dp[i - 1][j][t - 1] or 
                    dp[i + 1][j][t - 1] or
                dp[i][j + 1][t - 1] or dp[i][j - 1][t - 1];
                if (t == m)
                    ans += dp[i][j][t];
            }
        }
    }
    cout<<ans;
    return 0;
}

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