제출 #336068

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
336068		Sho10	Nautilus (BOI19_nautilus)	C++14	100 / 100	445 ms	1516 KiB

nautilus

#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
int n,m,k;
bitset<600005>a,dp;
int32_t main(){
CODE_START;
cin>>n>>m>>k;
for(int i=0;i<=n+1;i++)
{
    for(int j=0;j<=m+1;j++)
    {
        a[(m+2)*i+j]=0;
    }
}
for(int i=1;i<=n;i++)
{
    string x;
    cin>>x;
    for(int j=1;j<=m;j++)
    {
        a[(m+2)*i+j]=(x[j-1]=='.');
    }
}
dp|=a;
string s;
cin>>s;
for(auto it : s){
    if(it=='N'){
        dp=(a&(dp>>(m+2)));
    }else if(it=='S'){
    dp=(a&(dp<<(m+2)));
    }else if(it=='E'){
dp=(a&(dp<<1));
}else if(it=='W'){
dp=(a&(dp>>1));
}else {
dp=(a&((dp<<1)|(dp>>1)|(dp<<(m+2))|(dp>>(m+2))));
}
}
cout<<dp.count()<<endl;
}

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