oj.uz

Submission #493809

# Submission time Handle Problem Language Result Execution time Memory
493809 2021-12-13T03:11:31 Z Haruto810198 Nautilus (BOI19_nautilus) C++17
100 / 100
 132 ms 648 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define double long double

#define FOR(i, l, r, d) for(int i=(l); i<=(r); i+=(d))
#define szof(x) ((int)(x).size())

#define vi vector<int>
#define pii pair<int, int>

#define F first
#define S second

#define pb push_back
#define eb emplace_back
#define mkp make_pair

const int INF = INT_MAX;
const int LNF = INF*INF;
const int MOD = 1000000007;
const int mod = 998244353;
const double eps = 1e-12;

//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")

const int MAX = 510;

int r, c, m;
string str;
vector<bitset<MAX>> arr(MAX), dp(MAX), newdp(MAX);
int res;

signed main(){
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	cin>>r>>c>>m;
	FOR(i, 1, r, 1){
		FOR(j, 1, c, 1){
			char ch;
			cin>>ch;
			if(ch == '.') dp[i][c+1-j] = arr[i][c+1-j] = 1;
		}
	}

	cin>>str;
	for(char ch : str){
			
		if(ch == 'N'){
			FOR(i, 1, r-1, 1){
				newdp[i] = dp[i+1] & arr[i];
			}
			newdp[r].reset();
		}
		if(ch == 'S'){
			newdp[1].reset();
			FOR(i, 2, r, 1){
				newdp[i] = dp[i-1] & arr[i];
			}
		}
		if(ch == 'E'){
			FOR(i, 1, r, 1){
				newdp[i] = (dp[i] >> 1) & arr[i];
			}
		}
		if(ch == 'W'){
			FOR(i, 1, r, 1){
				newdp[i] = (dp[i] << 1) & arr[i];
			}
		}
		
		if(ch == '?'){
			newdp[1] = dp[2];
			FOR(i, 2, r-1, 1){
				newdp[i] = dp[i-1] | dp[i+1];
			}
			newdp[r] = dp[r-1];
			
			FOR(i, 1, r, 1){
				newdp[i] |= (dp[i] >> 1) | (dp[i] << 1);
			}

			FOR(i, 1, r, 1){
				newdp[i] &= arr[i];
			}
		}
		
		swap(dp, newdp);
		
	}

	FOR(i, 1, r, 1){
		FOR(j, 1, c, 1){
			res += dp[i][j];
		}
	}

	cout<<res<<'\n';
	
	return 0;

}

Subtask #1
29.0 / 29.0

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

Subtask #2
37.0 / 37.0

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

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 404 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 404 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 408 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 69 ms 332 KB Output is correct
23 Correct 74 ms 396 KB Output is correct
24 Correct 69 ms 396 KB Output is correct
25 Correct 66 ms 408 KB Output is correct
26 Correct 64 ms 332 KB Output is correct
27 Correct 104 ms 396 KB Output is correct
28 Correct 108 ms 392 KB Output is correct
29 Correct 105 ms 408 KB Output is correct
30 Correct 103 ms 332 KB Output is correct
31 Correct 100 ms 332 KB Output is correct
32 Correct 132 ms 392 KB Output is correct
33 Correct 130 ms 644 KB Output is correct
34 Correct 130 ms 588 KB Output is correct
35 Correct 126 ms 648 KB Output is correct
36 Correct 127 ms 648 KB Output is correct