Submission #258684

#	Time	Username	Problem	Language	Result	Execution time	Memory
258684		Evirir	Nautilus (BOI19_nautilus)	C++17	100 / 100	231 ms	159096 KiB

nautilus

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#define forn(i,a,b) for(int i=(a);i<(b);i++)
#define fore(i,a,b) for(int i=(a);i<=(b);i++)
#define pb push_back
#define F first
#define S second
#define pqueue priority_queue
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef long double ld;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;
void amin(ll &a, ll b){ a=min(a,b); }
void amax(ll &a, ll b){ a=max(a,b); }
void YES(){cout<<"YES\n";} void NO(){cout<<"NO\n";}
void SD(int t=0){ cout<<"PASSED "<<t<<endl; }
const ll INF = ll(1e18);
const int MOD = 998244353;

const bool DEBUG = 0;
const int MAXN = 505;
const int MAXK = 5005;

int n,m,K;
string s;
string A[MAXN];
bitset<MAXN> dp[MAXK][MAXN], a[MAXN];

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	
	cin>>n>>m>>K;
	forn(i,0,n) cin>>A[i];
	cin>>s;
	
	forn(i,0,n){
		forn(j,0,m){
			dp[0][i][j]=a[i][j]=(A[i][j]=='.');
		}
	}
	
	fore(k,1,K)
	{
		if(s[k-1]=='N'){
			forn(i,0,n-1) dp[k][i] = dp[k-1][i+1] & a[i];
		}
		if(s[k-1]=='S'){
			forn(i,1,n) dp[k][i] = dp[k-1][i-1] & a[i];
		}
		if(s[k-1]=='E'){
			forn(i,0,n) dp[k][i] = (dp[k-1][i]<<1) & a[i];
		}
		if(s[k-1]=='W'){
			forn(i,0,n) dp[k][i] = (dp[k-1][i]>>1) & a[i];
		}
		if(s[k-1]=='?'){
			forn(i,1,n) dp[k][i] |= dp[k-1][i-1] & a[i];
			forn(i,0,n-1) dp[k][i] |= dp[k-1][i+1] & a[i];
			forn(i,0,n) dp[k][i] |= (dp[k-1][i]<<1) & a[i];
			forn(i,0,n) dp[k][i] |= (dp[k-1][i]>>1) & a[i];
		}
	}
	
	int ans=0;
	forn(i,0,n){
		ans += dp[K][i].count();
	}
	cout<<ans<<'\n';
	
	return 0;
}

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