oj.uz

Submission #785680

# Submission time Handle Problem Language Result Execution time Memory
785680 2023-07-17T12:13:01 Z alex_2008 Awesome Arrowland Adventure (eJOI19_adventure) C++14
100 / 100
 95 ms 61364 KB 
#include <iostream>
#include <vector>
#include <cmath>
#include <set>
#include <queue>
using namespace std;
const int N = 550, INF = 1e9 + 10;
char a[N][N];
int vertex[N][N];
char dir[4] = { 'N', 'E', 'S', 'W' };
int dx[4] = { -1, 0, 1, 0 };
int dy[4] = { 0, 1, 0, -1 };
int n, m;
bool ch(int x, int y) {
	if (x >= 1 && x <= n && y >= 1 && y <= m) return true;
	return false;
}
vector <vector<pair<int, int>>> G;
int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> n >> m;
	G.resize(4 * n * m + 1);
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cin >> a[i][j];
			vertex[i][j] = (i - 1) * m + j;
		}
	}
	int sz = n * m;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (a[i][j] == 'X') continue;
			int ind = 0;
			for (int k = 0; k < 4; k++) {
				if (a[i][j] == dir[k]) {
					ind = k;
					break;
				}
			}
			if (ch(i + dx[ind], j + dy[ind])) {
				G[vertex[i][j]].push_back({ vertex[i + dx[ind]][j + dy[ind]], 0 });
			}
			int cost = 1, prev = vertex[i][j];
			ind = (ind + 1) % 4;
			while (cost != 4) {
				G[prev].push_back({ ++sz, 1 }); prev = sz;
				if (ch(i + dx[ind], j + dy[ind])) {
					G[sz].push_back({ vertex[i + dx[ind]][j + dy[ind]], 0 });
				}
				cost++;
				ind = (ind + 1) % 4;
			}
		}
	}
	vector <int> d(4 * n * m + 1, INF);
	d[1] = 0;
	deque <int> q;
	q.push_back(1);
	while (!q.empty()) {
		int v = q.front(); q.pop_front();
		if (v == n * m) {
			cout << d[v] << "\n";
			return 0;
		}
		for (auto it : G[v]) {
			if (d[it.first] > d[v] + it.second) {
				d[it.first] = d[v] + it.second;
				if (it.second == 0) {
					q.push_front(it.first);
				}
				else {
					q.push_back(it.first);
				}
			}
		}
	}
	cout << -1 << "\n";
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 456 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #5
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 1 ms 456 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 328 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 8 ms 5204 KB Output is correct
36 Correct 1 ms 724 KB Output is correct
37 Correct 9 ms 6228 KB Output is correct
38 Correct 12 ms 9684 KB Output is correct
39 Correct 95 ms 54388 KB Output is correct
40 Correct 92 ms 54292 KB Output is correct
41 Correct 71 ms 54292 KB Output is correct
42 Correct 94 ms 54368 KB Output is correct
43 Correct 84 ms 61364 KB Output is correct
44 Correct 69 ms 54272 KB Output is correct