oj.uz

Submission #496483

# Submission time Handle Problem Language Result Execution time Memory
496483 2021-12-21T10:41:48 Z armashka Nautilus (BOI19_nautilus) C++17
100 / 100
 287 ms 157352 KB 
#include <bits/stdc++.h>
 
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define all(v) v.begin(),v.end()
#define pb push_back
#define sz size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
 
const int N = 2e5 + 5;
const ll M = 1e8;
const ll inf = 1e9;
const ll mod = 1e9;
const double Pi = acos(-1); 
 
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }            
 
ll n, m, k;
char c[505][505];
string s;
bitset <505> b[505][5005];
 
const void solve(/*Armashka*/) {	
	cin >> n >> m >> k;
	for (int i = 1; i <= n; ++ i) {
		for (int j = 1; j <= m; ++ j) {
			cin >> c[i][j];
			if (c[i][j] == '#') b[i][0][j] = 0;
			else b[i][0][j] = 1;
		}
	}
	cin >> s;
	for (int i = 1; i <= k; ++ i) {
		char x = s[i - 1];
		for (int j = 1; j <= n; ++ j) {
			b[j][i] = b[j][0];
			if (x == 'E') {
				b[j][i] &= (b[j][i - 1] << 1);
			}
			if (x == 'W') {
				b[j][i] &= (b[j][i - 1] >> 1);
			}
			if (x == 'N') {
				b[j][i] &= b[j + 1][i - 1];
			}
			if (x == 'S') {
				b[j][i] &= b[j - 1][i - 1];
			}			
			if (x == '?') {
				b[j][i] &= ((b[j][i - 1] << 1) | (b[j][i - 1] >> 1) | (b[j + 1][i - 1]) | (b[j - 1][i - 1]));
			}
		}
	}	
	ll ans = 0;
	for (int i = 1; i <= n; ++ i) ans += b[i][k].count();
	cout << ans << "\n";
}   
 
signed main() {
    fast;
    //freopen("divide.in", "r", stdin);
    //freopen("divide.out", "w", stdout);
    int tt = 1;
    //cin >> tt;
    while (tt --) {
        solve();
    }
}                                                                          
 
/*
5 4 4
1 2
3 1
3 4
5 3
4 5 2 3
2 1 3 1
1 3 5
2 3 4 5
2 1 3 1
*/

Subtask #1
29.0 / 29.0

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

Subtask #2
37.0 / 37.0

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

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1356 KB Output is correct
2 Correct 2 ms 1356 KB Output is correct
3 Correct 1 ms 1356 KB Output is correct
4 Correct 2 ms 1356 KB Output is correct
5 Correct 2 ms 1356 KB Output is correct
6 Correct 1 ms 1356 KB Output is correct
7 Correct 1 ms 1356 KB Output is correct
8 Correct 1 ms 1356 KB Output is correct
9 Correct 1 ms 1356 KB Output is correct
10 Correct 1 ms 1356 KB Output is correct
11 Correct 1 ms 1356 KB Output is correct
12 Correct 2 ms 1356 KB Output is correct
13 Correct 1 ms 1408 KB Output is correct
14 Correct 1 ms 1356 KB Output is correct
15 Correct 2 ms 1356 KB Output is correct
16 Correct 2 ms 1356 KB Output is correct
17 Correct 2 ms 1356 KB Output is correct
18 Correct 2 ms 1356 KB Output is correct
19 Correct 2 ms 1356 KB Output is correct
20 Correct 2 ms 1356 KB Output is correct
21 Correct 1 ms 1356 KB Output is correct
22 Correct 148 ms 157224 KB Output is correct
23 Correct 147 ms 157352 KB Output is correct
24 Correct 154 ms 157352 KB Output is correct
25 Correct 179 ms 157212 KB Output is correct
26 Correct 200 ms 157276 KB Output is correct
27 Correct 213 ms 157276 KB Output is correct
28 Correct 180 ms 157248 KB Output is correct
29 Correct 212 ms 157204 KB Output is correct
30 Correct 196 ms 157240 KB Output is correct
31 Correct 219 ms 157216 KB Output is correct
32 Correct 270 ms 157252 KB Output is correct
33 Correct 231 ms 157348 KB Output is correct
34 Correct 252 ms 157252 KB Output is correct
35 Correct 207 ms 157280 KB Output is correct
36 Correct 287 ms 157228 KB Output is correct