Submission #890412

#	Time	Username	Problem	Language	Result	Execution time	Memory
890412		vjudge1	Nautilus (BOI19_nautilus)	C++17	100 / 100	138 ms	888 KiB

nautilus

#include<bits/stdc++.h>
#define pb push_back
#define pf push_front
#define F first
#define S second
#define ff first
#define ss second
#define ll long long
#define ull unsigned long long
#define ld long double
#define pll pair<ll,ll>
#define plll pair<ll,pll>
#define pllll pair<pll,pll>
#define vl vector<ll>
#define vll vector<pll>
#define vlll vector<plll>
#define vllll vector<pllll>
#define vb vector<bool>
#define sz size()
#define fr front()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define bk back();
using namespace std;
const ld pi=3.14159265359;
const ll e5=1e5;
const ll e6=1e6;
const ll e9=1e9;
const ll inf=1e18;
const ll mod=1e9+7;
const ll mod2=998244353;
const ll N=1e5+5;
ll bpm(ll x,ll y,ll m){if(y==0)return 1%m;if(y==1)return x%m;ll p=bpm(x,y/2,m);
if(y%2==0)return p*p%m;else return p*p%m*x%m;}
ll bp(ll x,ll y){if(y==0)return 1;if(y==1)return x;ll p=bp(x,y/2);
if(y%2==0)return p*p;else return p*p*x;}
void solve(/**/){
    ll r,c,m;
    string s;
    cin>>r>>c>>m;
    vector<bitset<500> > a(r),b(r),down(r),up(r),left(r),right(r);
    bitset<500> zr;
    for(ll i=0;i<r;i++){
        for(ll j=0;j<c;j++){
            char ch; cin>>ch;
            if(ch=='.'){
                a[i][j]=b[i][j]=(ch=='.');
            }
        }
    }
    cin>>s;
    for(char ch:s){
        if(ch=='N'){
            for(ll i=0;i<r-1;i++){
                a[i]=a[i+1];
            }
            a[r-1]=zr;
        }else if(ch=='E'){
            for(ll i=0;i<r;i++){
                a[i]<<=1;
            }
        }else if(ch=='S'){
            for(ll i=r-1;i>0;i--){
                a[i]=a[i-1];
            }
            a[0]=zr;
        }else if(ch=='W'){
            for(ll i=0;i<r;i++){
                a[i]>>=1;
            }
        }else if(ch=='?'){
			up[0]=zr;
			down[r-1]=zr;
			for(ll i=0;i<r;i++){
				if(i!=0) up[i]=a[i-1];
				if (i!=r-1) down[i]=a[i+1];
				left[i]=(a[i]>>1);
				right[i]=(a[i]<<1);
			}
			for(ll i=0;i<r;i++){
				a[i]=up[i]|down[i]|right[i]|left[i];
				a[i]&=b[i];
			}
        }
        for(ll i=0;i<r;i++) a[i]&=b[i];
    }
    ll x=0;
    for(ll i=0;i<r;i++){
        for(ll j=0;j<c;j++){
            if(a[i][j]) x++;
        }
    }
    cout<<x;
    return;
}
int main(/*Aldk*/){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    //freopen(".in", "r", stdin);
    //freopen(".out", "w", stdout);    
    //cout<<setprecision(6)<<fixed;
    ll T=1;
    //cin>>T;
    for(ll i=1;i<=T;i++){
        //cout<<"Case #"<<i<<": ";
        solve();
        //cout<<'\n';
    }
    return 0;
}

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