oj.uz

Submission #414683

# Submission time Handle Problem Language Result Execution time Memory
414683 2021-05-31T03:52:06 Z milleniumEeee Nautilus (BOI19_nautilus) C++17
66 / 100
 1000 ms 1256 KB 
#include <bits/stdc++.h>
#define prev prevw313131313
#define next next131313131
#define pb push_back
using namespace std;

const int MAXN = 505;

char tp[MAXN][MAXN];
bool dp[2][MAXN][MAXN];

int toY[] = {-1, 0, 1, 0};
int toX[] = {0, 1, 0, -1};

bool in(int y, int x, int r, int c) {
	return 1 <= y && y <= r && 1 <= x && x <= c;
}

int pos[1000];


signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int r, c, m;
	cin >> r >> c >> m;
	pos['N'] = 0;
	pos['E'] = 1;
	pos['S'] = 2;
	pos['W'] = 3;
	for (int i = 1; i <= r; i++) {
		for (int j = 1; j <= c; j++) {
			cin >> tp[i][j];
		}
	}
	string mp;
	cin >> mp;
	mp = ' ' + mp;
	for (int i = 1; i <= r; i++) {
		for (int j = 1; j <= c; j++) {
			if (tp[i][j] == '.') {
				dp[0][i][j] = 1;
			}
		}
	}
	// 0 moves
	for (int step = 1; step <= m; step++) {
		int prev = ((step - 1) & 1);
		int cur = (step & 1);
		for (int y = 1; y <= r; y++) {
			for (int x = 1; x <= c; x++) {
				dp[cur][y][x] = 0;
			}
		}
		vector <int> possible;
		if (mp[step] == '?') {
			for (int k = 0; k < 4; k++) {
				possible.pb(k);
			}
		} else {
			possible.pb(pos[mp[step]]);
		}
		for (int y = 1; y <= r; y++) {
			for (int x = 1; x <= c; x++) {
				if (dp[prev][y][x]) {
					for (int el : possible) {
						int nY = y + toY[el];
						int nX = x + toX[el];
						if (in(nY, nX, r, c) && tp[nY][nX] == '.') {
							dp[cur][nY][nX] = 1;
						}
					}
				}
			}
		}
	}
	int ans = 0;
	for (int y = 1; y <= r; y++) {
		for (int x = 1; x <= c; x++) {
			ans += dp[m % 2][y][x];
		}
	}
	cout << ans << endl;
}

/*
5 9 7
...##....
..#.##..#
..#....##
.##...#..
....#....
WS?EE??
*/

Compilation message

nautilus.cpp: In function 'int main()':
nautilus.cpp:61:28: warning: array subscript has type 'char' [-Wchar-subscripts]
   61 |    possible.pb(pos[mp[step]]);
      |                            ^

Subtask #1
29.0 / 29.0

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

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 460 KB Output is correct
2 Correct 3 ms 456 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 18 ms 456 KB Output is correct
8 Correct 7 ms 456 KB Output is correct
9 Correct 4 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 28 ms 492 KB Output is correct
13 Correct 26 ms 460 KB Output is correct
14 Correct 20 ms 492 KB Output is correct
15 Correct 3 ms 460 KB Output is correct
16 Correct 2 ms 456 KB Output is correct
17 Correct 36 ms 484 KB Output is correct
18 Correct 33 ms 460 KB Output is correct
19 Correct 16 ms 492 KB Output is correct
20 Correct 6 ms 460 KB Output is correct
21 Correct 2 ms 492 KB Output is correct

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 460 KB Output is correct
2 Correct 3 ms 456 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 18 ms 456 KB Output is correct
8 Correct 7 ms 456 KB Output is correct
9 Correct 4 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 28 ms 492 KB Output is correct
13 Correct 26 ms 460 KB Output is correct
14 Correct 20 ms 492 KB Output is correct
15 Correct 3 ms 460 KB Output is correct
16 Correct 2 ms 456 KB Output is correct
17 Correct 36 ms 484 KB Output is correct
18 Correct 33 ms 460 KB Output is correct
19 Correct 16 ms 492 KB Output is correct
20 Correct 6 ms 460 KB Output is correct
21 Correct 2 ms 492 KB Output is correct
22 Execution timed out 1088 ms 1256 KB Time limit exceeded
23 Halted 0 ms 0 KB -