Submission #405283

#	Time	Username	Problem	Language	Result	Execution time	Memory
405283		codebuster_10	Nautilus (BOI19_nautilus)	C++17	100 / 100	236 ms	852 KiB

nautilus

#include <bits/stdc++.h>

using namespace std ;

#define int int64_t //be careful about this 
#define endl "\n"
#define f(i,a,b) for(int i=int(a);i<int(b);++i)

#define pr pair
#define ar array
#define fr first
#define sc second
#define vt vector
#define pb push_back
#define eb emplace_back
#define LB lower_bound  
#define UB upper_bound
#define PQ priority_queue

#define sz(x) ((int)(x).size())
#define all(a) (a).begin(),(a).end()
#define allr(a) (a).rbegin(),(a).rend()
#define mem0(a) memset(a, 0, sizeof(a))
#define mem1(a) memset(a, -1, sizeof(a))

template<class A> void rd(vt<A>& v);
template<class T> void rd(T& x){ cin >> x; }
template<class H, class... T> void rd(H& h, T&... t) { rd(h) ; rd(t...) ;}
template<class A> void rd(vt<A>& x) { for(auto& a : x) rd(a) ;}

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

template<typename T>
void __p(T a) {
  cout<<a; 
}
template<typename T, typename F>
void __p(pair<T, F> a) {
  cout<<"{";
  __p(a.first);
  cout<<",";
  __p(a.second);
  cout<<"}\n"; 
}
template<typename T>
void __p(std::vector<T> a) {
  cout<<"{";
  for(auto it=a.begin(); it<a.end(); it++)
    __p(*it),cout<<",}\n"[it+1==a.end()]; 
}
template<typename T, typename ...Arg>
void __p(T a1, Arg ...a) {
  __p(a1);
  __p(a...);
}
template<typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
  cout<<name<<" : ";
  __p(arg1);
  cout<<endl;
}
template<typename Arg1, typename ... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args) {
  int bracket=0,i=0;
  for(;; i++)
    if(names[i]==','&&bracket==0)
      break;
    else if(names[i]=='(')
      bracket++;
    else if(names[i]==')')
      bracket--;
  const char *comma=names+i;
  cout.write(names,comma-names)<<" : ";
  __p(arg1);
  cout<<" | ";
  __f(comma+1,args...);
}

void setIO(string s = "") {
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); 
  cin.exceptions(cin.failbit); 
	cout.precision(15);	cout << fixed;
  #ifdef ONLINE_JUDGE
  if(sz(s)){
  	freopen((s+".in").c_str(),"r",stdin);
  	freopen((s+".out").c_str(),"w",stdout);
  }
  #define __f(...) 0
  #endif
}
const int MX = 500;
bitset<MX> now[MX],g[MX],S[MX],E[MX],W[MX],N[MX],Z;
int R,C,M;

void _N(){
	f(i,0,R-1) N[i] = now[i+1];
	N[R-1] = Z;
	f(i,0,R) N[i] &= g[i];
}
void _S(){
	S[0] = Z;
	f(i,1,R) S[i] = now[i-1];
	f(i,0,R) S[i] &= g[i];
}
void _E(){
	f(i,0,R) E[i] = (now[i] << 1);
	f(i,0,R) E[i] &= g[i];
}
void _W(){
	f(i,0,R) W[i] = (now[i] >> 1);
	f(i,0,R) W[i] &= g[i];
}

signed main(){
  setIO();
  rd(R,C,M);
  f(i,0,R){
  	f(j,0,C){
  		char c; rd(c);
  		if(c == '.'){
  			g[i][j] = now[i][j] = true;
  		}
  	}
  }
  
  while(M--){
  	char c; rd(c);
  	if(c == 'N'){
  		_N();
  		f(i,0,R) now[i] = N[i];
  	}else if(c == 'S'){
  		_S();
  		f(i,0,R) now[i] = S[i];
  	}else if(c == 'E'){
  		_E();
  		f(i,0,R) now[i] = E[i];
  	}else if(c == 'W'){
  		_W();
  		f(i,0,R) now[i] = W[i];
  	}else if(c == '?'){
  		_N();
  		_S();
  		_E();
  		_W();
  		f(i,0,R) now[i] = N[i]|S[i]|E[i]|W[i];
  	}
  }
  int ans = 0;
  f(i,0,R) ans += int(now[i].count());
  cout << ans;
}

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