oj.uz

Submission #586850

# Submission time Handle Problem Language Result Execution time Memory
586850 2022-06-30T18:14:23 Z Markomafko972 Awesome Arrowland Adventure (eJOI19_adventure) C++14
100 / 100
 186 ms 18156 KB 
#include <bits/stdc++.h>
#define X first
#define Y second
using namespace std;

int n, m;
char c;
int kol[502][502];
int dist[502][502];
set< pair<int, pair<int, int> > > s;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};

int main () {
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> c;
			if (c == 'N') kol[i][j] = 0;
			else if (c == 'E') kol[i][j] = 1;
			else if (c == 'S') kol[i][j] = 2;
			else if (c == 'W') kol[i][j] = 3;
			else kol[i][j] = -1;
		
			dist[i][j] = 1e9;
			if (i == 0 && j == 0) dist[i][j] = 0;
			s.insert({dist[i][j], {i, j}});
		}
	}
	
	while (!s.empty()) {
		int cost = s.begin() -> first;
		pair<int, int> p = s.begin() -> second;
		s.erase(s.begin());
		if (kol[p.X][p.Y] == -1) continue;
		
		for (int i = 0; i < 4; i++) {
			int x = p.X + dx[i];
			int y = p.Y + dy[i];
			if (x < 0 || y < 0 || x >= n || y >= m) continue;
			
			int novi = i-kol[p.X][p.Y];
			if (novi < 0) novi += 4;
			if (cost+novi < dist[x][y]) {
				s.erase({dist[x][y], {x, y}});
				dist[x][y] = cost+novi;
				s.insert({dist[x][y], {x, y}});
			}
		}
	}
	
	if (dist[n-1][m-1] >= 1e9) cout << -1;
	else cout << dist[n-1][m-1];
	
	
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 324 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 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 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 0 ms 212 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 324 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 328 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 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 324 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 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 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 0 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 324 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 328 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 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 324 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 16 ms 2016 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 17 ms 2440 KB Output is correct
38 Correct 11 ms 3984 KB Output is correct
39 Correct 186 ms 18156 KB Output is correct
40 Correct 183 ms 18124 KB Output is correct
41 Correct 75 ms 18116 KB Output is correct
42 Correct 181 ms 18056 KB Output is correct
43 Correct 158 ms 18064 KB Output is correct
44 Correct 83 ms 18156 KB Output is correct