Submission #1215838

#	Time	Username	Problem	Language	Result	Execution time	Memory
1215838		Malix	Nautilus (BOI19_nautilus)	C++20	100 / 100	52 ms	544 KiB

nautilus

#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("Ofast")
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> ti;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
#define all(x) x.begin(),x.end()

ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;

bitset<500> b[500],a[2][500];

int main() {   
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n,m,k;cin>>n>>m>>k;
    memset(a,0,sizeof(a));
    memset(b,0,sizeof(b));
    REP(i,0,n)REP(j,0,m){
        char c;cin>>c;
        if(c=='.'){
            a[0][i][j]=1;
            b[i][j]=1;
        }
    }
    string s;cin>>s;
    REP(i,0,k){
        if(s[i]=='?')REP(x,0,n){
            if(x!=0)a[1][x]|=a[0][x-1];
            if(x!=n-1)a[1][x]|=a[0][x+1];
            a[1][x]|=(a[0][x]>>1);
            a[1][x]|=(a[0][x]<<1);
        }
        if(s[i]!='?'){
            if(s[i]=='N')REP(x,0,n-1)a[1][x]|=a[0][x+1];
            else if(s[i]=='S')REP(x,1,n)a[1][x]|=a[0][x-1];
            else if(s[i]=='W')REP(x,0,n)a[1][x]|=(a[0][x]>>1);
            else if(s[i]=='E')REP(x,0,n)a[1][x]|=(a[0][x]<<1);
        }
        REP(x,0,n)a[0][x]=(a[1][x]&b[x]);
        memset(a[1],0,sizeof(a[1]));
    }
    int ans=0;
    REP(i,0,n)ans+=a[0][i].count();
    cout<<ans;
}

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