Submission #969974

#TimeUsernameProblemLanguageResultExecution timeMemory
969974AiperiiiNautilus (BOI19_nautilus)C++14
66 / 100
9 ms9148 KiB
#include <bits/stdc++.h>
#define int long long
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
const int N=105;
char a[N][N];
int dp[N][N][N];
signed main(){
    ios_base::sync_with_stdio();
    cin.tie(0);cout.tie(0);
    int n,m,k;
    cin>>n>>m>>k;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            cin>>a[i][j];
            if(a[i][j]=='.')dp[0][i][j]=1;
        }
    }
    string s;cin>>s;
    s=' '+s;
    for(int x=0;x<k;x++){
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                if(dp[x][i][j]){
                    if((s[x+1]=='W' or s[x+1]=='?') && j-1>=0 && a[i][j-1]=='.')dp[x+1][i][j-1]=1;
                    if((s[x+1]=='E' or s[x+1]=='?') && j+1<m && a[i][j+1]=='.')dp[x+1][i][j+1]=1;
                    if((s[x+1]=='S' or s[x+1]=='?') && i+1<n && a[i+1][j]=='.')dp[x+1][i+1][j]=1;
                    if((s[x+1]=='N' or s[x+1]=='?') && i-1>=0 && a[i-1][j]=='.')dp[x+1][i-1][j]=1;
                }
            }
        }
    }
    int ans=0;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(dp[k][i][j])ans++;
        }
    }
    cout<<ans<<"\n";
}
/*
 5 9 7
 ...##....
 ..#.##..#
 ..#....##
 .##...#..
 ....#....
 WS?EE??
 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...