oj.uz

답안 #1116499

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1116499 2024-11-21T17:55:10 Z xnqs Nautilus (BOI19_nautilus) C++17
66 / 100
 1000 ms 1104 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2")

#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
#include <cstring>

int x, y, p;
std::vector<std::string> arr;
std::string moves;
bool dp[2][505][505];

const int dx[] = {0,1,0,-1};
const int dy[] = {1,0,-1,0};

inline bool in_mat(int i, int j) {
	return !(i<0||i>=x||j<0||j>=y);
}

void solve_dp() {
	for (int pos = 0; pos <= p; pos++) {
		int curr_pos = pos&1;
		int last_pos = curr_pos^1;
		for (int i = 0; i < x; i++) {
			for (int j = 0; j < y; j++) {
				if (arr[i][j]=='#') {
					dp[curr_pos][i][j] = 0;
					continue;
				}
				if (pos==0) {
					dp[curr_pos][i][j] = 1;
					continue;
				}

				dp[curr_pos][i][j] = 0;
				switch (moves[pos-1]) {
				case 'N':
					dp[curr_pos][i][j] = ((in_mat(i+1,j)) ? dp[last_pos][i+1][j] : 0);
					break;
				case 'S':
					dp[curr_pos][i][j] = ((in_mat(i-1,j)) ? dp[last_pos][i-1][j] : 0);
					break;
				case 'E':
					dp[curr_pos][i][j] = ((in_mat(i,j-1)) ? dp[last_pos][i][j-1] : 0);
					break;
				case 'W':
					dp[curr_pos][i][j] = ((in_mat(i,j+1)) ? dp[last_pos][i][j+1] : 0);
					break;
				default:
					for (int k = 0; k < 4; k++) {
						int iv = i+dx[k];
						int jv = j+dy[k];
						dp[curr_pos][i][j] |= ((in_mat(iv,jv)) ? dp[last_pos][iv][jv] : 0);
					}
					break;
				}
			}
		}
	}
}

int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(NULL);
	std::cout.tie(NULL);

	std::cin >> x >> y >> p;
	arr.resize(x);
	for (auto& i : arr) {
		std::cin >> i;
	}
	std::cin >> moves;

	solve_dp();
	int ret = 0;
	for (int i = 0; i < x; i++) {
		for (int j = 0; j < y; j++) {
			ret += dp[p&1][i][j];
		}
	}

	std::cout << ret << "\n";
}

Subtask #1
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 592 KB Output is correct
2 Correct 4 ms 336 KB Output is correct
3 Correct 5 ms 336 KB Output is correct
4 Correct 5 ms 336 KB Output is correct
5 Correct 3 ms 336 KB Output is correct
6 Correct 3 ms 480 KB Output is correct

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 592 KB Output is correct
2 Correct 4 ms 336 KB Output is correct
3 Correct 5 ms 336 KB Output is correct
4 Correct 5 ms 336 KB Output is correct
5 Correct 3 ms 336 KB Output is correct
6 Correct 3 ms 480 KB Output is correct
7 Correct 5 ms 424 KB Output is correct
8 Correct 6 ms 592 KB Output is correct
9 Correct 6 ms 592 KB Output is correct
10 Correct 3 ms 336 KB Output is correct
11 Correct 2 ms 352 KB Output is correct
12 Correct 5 ms 336 KB Output is correct
13 Correct 6 ms 508 KB Output is correct
14 Correct 6 ms 336 KB Output is correct
15 Correct 4 ms 592 KB Output is correct
16 Correct 2 ms 336 KB Output is correct
17 Correct 7 ms 592 KB Output is correct
18 Correct 6 ms 336 KB Output is correct
19 Correct 3 ms 336 KB Output is correct
20 Correct 3 ms 336 KB Output is correct
21 Correct 2 ms 592 KB Output is correct

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 592 KB Output is correct
2 Correct 4 ms 336 KB Output is correct
3 Correct 5 ms 336 KB Output is correct
4 Correct 5 ms 336 KB Output is correct
5 Correct 3 ms 336 KB Output is correct
6 Correct 3 ms 480 KB Output is correct
7 Correct 5 ms 424 KB Output is correct
8 Correct 6 ms 592 KB Output is correct
9 Correct 6 ms 592 KB Output is correct
10 Correct 3 ms 336 KB Output is correct
11 Correct 2 ms 352 KB Output is correct
12 Correct 5 ms 336 KB Output is correct
13 Correct 6 ms 508 KB Output is correct
14 Correct 6 ms 336 KB Output is correct
15 Correct 4 ms 592 KB Output is correct
16 Correct 2 ms 336 KB Output is correct
17 Correct 7 ms 592 KB Output is correct
18 Correct 6 ms 336 KB Output is correct
19 Correct 3 ms 336 KB Output is correct
20 Correct 3 ms 336 KB Output is correct
21 Correct 2 ms 592 KB Output is correct
22 Execution timed out 1077 ms 1104 KB Time limit exceeded
23 Halted 0 ms 0 KB -