oj.uz

Submission #976513

# Submission time Handle Problem Language Result Execution time Memory
976513 2024-05-06T16:11:26 Z vjudge1 Awesome Arrowland Adventure (eJOI19_adventure) C++17
100 / 100
 78 ms 4956 KB 
#include<bits/stdc++.h>
using namespace std;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const char cc[] = {'N', 'E', 'S', 'W'};

int n, m;
vector<string> grid;
vector<vector<int>> dist;
priority_queue<tuple<int, int, int>, vector<tuple<int, int, int>>, greater<>> pq;

int val(char c) {
	if (c == 'N') return 1;
	if (c == 'E') return 2;
	if (c == 'S') return 3;
	if (c == 'W') return 4;
	return 0;
}

int rot(char a, char b) {
	return (val(b) - val(a) + 4) % 4;
}

bool inside(int x, int y) {
	return x >= 0 && x < n && y >= 0 && y < m;
}

signed main() {
	cin >> n >> m;

	grid.resize(n);
	dist.assign(n, vector<int>(m, 1000000000));

	for (int i = 0; i < n; i++) {
		cin >> grid[i];
	}

	pq.push({0,0,0});

	while (!pq.empty()) {
		auto [d, x, y] = pq.top();
		pq.pop();

		if (grid[x][y] == 'X') continue;

		for (int i = 0; i < 4; i++) {
			int nx = x + dx[i], ny = y + dy[i], c = cc[i];
			if (inside(nx, ny) && dist[nx][ny] > d + rot(grid[x][y], c)) {
				dist[nx][ny] = d + rot(grid[x][y], c);
				pq.push({dist[nx][ny], nx, ny});
			}
		}
	}

	cout << (dist[n-1][m-1] == 1e9 ? -1 : dist[n-1][m-1]) << '\n';
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 372 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #5
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 372 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 4 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 5 ms 604 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 47 ms 1884 KB Output is correct
40 Correct 47 ms 1944 KB Output is correct
41 Correct 5 ms 1880 KB Output is correct
42 Correct 49 ms 1948 KB Output is correct
43 Correct 78 ms 4956 KB Output is correct
44 Correct 5 ms 2132 KB Output is correct