제출 #969984

#제출 시각아이디문제언어결과실행 시간메모리
969984AiperiiiNautilus (BOI19_nautilus)C++14
66 / 100
1062 ms32068 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=505;
char a[N][N];
signed main(){
    ios_base::sync_with_stdio();
    cin.tie(0);cout.tie(0);
    int n,m,k;
    cin>>n>>m>>k;
    set <pair <int,int> > v1,v2;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            cin>>a[i][j];
            if(a[i][j]=='.')v1.insert({i,j});
        }
    }
    
    string s;cin>>s;
    s=' '+s;
    for(int x=0;x<k;x++){
        for(auto y : v1){
            int i=y.ff,j=y.ss;
            if((s[x+1]=='W' or s[x+1]=='?') && j-1>=0 && a[i][j-1]=='.')v2.insert({i,j-1});
            if((s[x+1]=='E' or s[x+1]=='?') && j+1<m && a[i][j+1]=='.')v2.insert({i,j+1});
            if((s[x+1]=='S' or s[x+1]=='?') && i+1<n && a[i+1][j]=='.')v2.insert({i+1,j});
            if((s[x+1]=='N' or s[x+1]=='?') && i-1>=0 && a[i-1][j]=='.')v2.insert({i-1,j});
        }
        swap(v1,v2);
        v2.clear();
    }
    cout<<v1.size();
}
/*
 5 9 7
 ...##....
 ..#.##..#
 ..#....##
 .##...#..
 ....#....
 WS?EE??
 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...