Submission #496517

#	Time	Username	Problem	Language	Result	Execution time	Memory
496517		mansur	Nautilus (BOI19_nautilus)	C++17	100 / 100	151 ms	157628 KiB

nautilus

#include<bits/stdc++.h>	
 
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
#pragma comment(linker, "/stack:200000000")
 
//01001101 01100001 01101011 01101000 01100001  01100111 01100001 01111001 
 
using namespace std;
 
#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()                                                                   
#define ld double
#define ull unsigned long long
#define ff first                                         
#define ss second  
#define fix fixed << setprecision
#define pii pair<int, int>                          
#define E exit (0)
#define int long long
 
const int inf = 1e15, N = 1e6 + 1, mod = 998244353;                    
 
vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
 
main() {                                                         
	//freopen("cowrect.in", "r", stdin);                                                                                     
	//freopen("cowrect.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(NULL);                                                                                        
	cin.tie(NULL);
	int n, m, r;
	cin >> n >> m >> r;
	bitset<501> s[r + 1][n + 2], p[n + 2];
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			char c;
			cin >> c;
			if (c == '.') {
				s[0][i][j] = 1;
				p[i][j] = 1;
			}
		}
	}
	string h;
	cin >> h;
	for (int i = 0; i < r; i++) {
		if (h[i] == '?') {
		 	for (int j = 1; j <= n; j++) {
				s[i + 1][j] = ((p[j] & (s[i][j] >> 1)) | (p[j] & (s[i][j] << 1))) | ((s[i][j + 1] & p[j]) | (s[i][j - 1] & p[j]));
			}
		}else if (h[i] == 'W' || h[i] == 'E') {
			for (int j = 1; j <= n; j++) {
				if (h[i] == 'W') s[i + 1][j] = (p[j] & (s[i][j] >> 1));
				else s[i + 1][j] = (p[j] & (s[i][j] << 1)); 
			}
		}else {
			for (int j = 1; j <= n; j++) {
			 	s[i + 1][j] = (s[i][(h[i] == 'N' ? j + 1 : j - 1)] & p[j]);
			}
		}
	}
	int ans = 0;
	for (int i = 1; i <= n; i++) ans += s[r][i].count();
	cout << ans;
}

Compilation message (stderr)

nautilus.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize ("g",on)
      | 
nautilus.cpp:9: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    9 | #pragma comment(linker, "/stack:200000000")
      | 
nautilus.cpp:35:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   35 | main() {
      | ^~~~

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