Submission #304391

#	Time	Username	Problem	Language	Result	Execution time	Memory
304391		Hemimor	Nautilus (BOI19_nautilus)	C++14	100 / 100	225 ms	876 KiB

nautilus

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <bitset>
#include <vector>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<P,int> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=1e9+7;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};

const int M=500;
bitset<M> a[M],b[M];
int h,w,q;
string s;

int main(){
	cin>>h>>w>>q;
	for(int i=0;i<h;i++) for(int j=0;j<w;j++){
		char c;
		cin>>c;
		if(c=='.') a[i][j]=b[i][j]=1;
	}
	cin>>s;
	for(auto c:s){
		if(c=='E'){
			for(int i=0;i<h;i++) a[i]<<=1;
		}
		else if(c=='W'){
			for(int i=0;i<h;i++) a[i]>>=1;
		}
		else if(c=='N'){
			for(int i=0;i<h-1;i++) a[i]=a[i+1];
			a[h-1].reset();
		}
		else if(c=='S'){
			for(int i=h-1;i>=1;i--) a[i]=a[i-1];
			a[0].reset();
		}
		else{
			bitset<M> c[M],d[M];
			for(int i=0;i<M;i++) c[i]=(a[i]>>1)|(a[i]<<1);
			for(int i=0;i<h-1;i++) d[i]|=a[i+1];
			for(int i=1;i<h;i++) d[i]|=a[i-1];
			for(int i=0;i<M;i++) a[i]=c[i]|d[i];
		}
		for(int i=0;i<h;i++) a[i]&=b[i];
	}
	int res=0;
	for(int i=0;i<h;i++) res+=a[i].count();
	cout<<res<<endl;
}

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