oj.uz

Submission #496517

# Submission time Handle Problem Language Result Execution time Memory
496517 2021-12-21T11:50:53 Z mansur Nautilus (BOI19_nautilus) C++17
100 / 100
 151 ms 157628 KB 
#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

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.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 844 KB Output is correct
2 Correct 1 ms 844 KB Output is correct
3 Correct 1 ms 844 KB Output is correct
4 Correct 1 ms 844 KB Output is correct
5 Correct 1 ms 844 KB Output is correct
6 Correct 1 ms 844 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 844 KB Output is correct
2 Correct 1 ms 844 KB Output is correct
3 Correct 1 ms 844 KB Output is correct
4 Correct 1 ms 844 KB Output is correct
5 Correct 1 ms 844 KB Output is correct
6 Correct 1 ms 844 KB Output is correct
7 Correct 1 ms 844 KB Output is correct
8 Correct 1 ms 844 KB Output is correct
9 Correct 1 ms 844 KB Output is correct
10 Correct 1 ms 952 KB Output is correct
11 Correct 1 ms 844 KB Output is correct
12 Correct 1 ms 844 KB Output is correct
13 Correct 1 ms 844 KB Output is correct
14 Correct 1 ms 844 KB Output is correct
15 Correct 1 ms 844 KB Output is correct
16 Correct 1 ms 844 KB Output is correct
17 Correct 1 ms 844 KB Output is correct
18 Correct 1 ms 844 KB Output is correct
19 Correct 1 ms 844 KB Output is correct
20 Correct 1 ms 844 KB Output is correct
21 Correct 1 ms 844 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 844 KB Output is correct
2 Correct 1 ms 844 KB Output is correct
3 Correct 1 ms 844 KB Output is correct
4 Correct 1 ms 844 KB Output is correct
5 Correct 1 ms 844 KB Output is correct
6 Correct 1 ms 844 KB Output is correct
7 Correct 1 ms 844 KB Output is correct
8 Correct 1 ms 844 KB Output is correct
9 Correct 1 ms 844 KB Output is correct
10 Correct 1 ms 952 KB Output is correct
11 Correct 1 ms 844 KB Output is correct
12 Correct 1 ms 844 KB Output is correct
13 Correct 1 ms 844 KB Output is correct
14 Correct 1 ms 844 KB Output is correct
15 Correct 1 ms 844 KB Output is correct
16 Correct 1 ms 844 KB Output is correct
17 Correct 1 ms 844 KB Output is correct
18 Correct 1 ms 844 KB Output is correct
19 Correct 1 ms 844 KB Output is correct
20 Correct 1 ms 844 KB Output is correct
21 Correct 1 ms 844 KB Output is correct
22 Correct 115 ms 157540 KB Output is correct
23 Correct 109 ms 157504 KB Output is correct
24 Correct 110 ms 157508 KB Output is correct
25 Correct 108 ms 157520 KB Output is correct
26 Correct 108 ms 157512 KB Output is correct
27 Correct 131 ms 157436 KB Output is correct
28 Correct 132 ms 157504 KB Output is correct
29 Correct 149 ms 157508 KB Output is correct
30 Correct 134 ms 157432 KB Output is correct
31 Correct 134 ms 157548 KB Output is correct
32 Correct 144 ms 157444 KB Output is correct
33 Correct 150 ms 157436 KB Output is correct
34 Correct 147 ms 157544 KB Output is correct
35 Correct 149 ms 157628 KB Output is correct
36 Correct 151 ms 157464 KB Output is correct