Submission #891149

#	Time	Username	Problem	Language	Result	Execution time	Memory
891149		vjudge1	Nautilus (BOI19_nautilus)	C++17	100 / 100	158 ms	1112 KiB

nautilus

#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
 
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt")


typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back

const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(2e3)+100;
const long long inf = 2e18;
const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }

ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}


void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }

int r, c, m;
bitset<500> orig[500], pot[500], lef[500], righ[500], down[500], up[500], em;
string s;

void Baizho() {	
	cin>>r>>c>>m;
	for(int i = 0; i < r; i ++) {
		for(int j = 0; j < c; j ++) {
			char a; cin>>a;
			orig[i][j] = (a == '.');
			pot[i][j] = (a == '.');
		}
	}
	cin>>s;
	for(auto x : s) {
		if(x == 'N') {
			for(int i = 0; i < r - 1; i ++) pot[i] = (pot[i + 1] & orig[i]);
			pot[r - 1] = em;
		} else if(x == 'S') {
			for(int i = r - 1; i >= 1; i --) pot[i] = (pot[i - 1] & orig[i]);
			pot[0] = em;
		} else if(x == 'W') {
			for(int i = 0; i < r; i ++) pot[i] = ((pot[i] >> 1) & orig[i]);
		} else if(x == 'E') {
			for(int i = 0; i < r; i ++) pot[i] = ((pot[i] << 1) & orig[i]);
		} else {
			up[r - 1] = em;
			down[0] = em;
			for(int i = 0; i < r - 1; i ++) up[i] = (pot[i + 1]);
			for(int i = 1; i < r; i ++) down[i] = (pot[i - 1]);
			for(int i = 0; i < r; i ++) lef[i] = (pot[i] >> 1);
			for(int i = 0; i < r; i ++) righ[i] = (pot[i] << 1);
			for(int i = 0; i < r; i ++) {
				pot[i] = (((up[i] | down[i]) | lef[i]) | righ[i]) & orig[i];
			}
		}
	}
	int ans = 0;
	for(int i = 0; i < r; i ++) for(int j = 0; j < c; j ++) ans += pot[i][j];
	cout<<ans;
}
 
signed main() {		
 
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
//    cin>>ttt;

    for(int i=1; i<=ttt; i++) { Baizho(); }
}

Compilation message (stderr)

nautilus.cpp: In function 'void Freopen(std::string)':
nautilus.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
nautilus.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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