oj.uz

답안 #790259

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
790259 2023-07-22T13:43:13 Z Ludissey Awesome Arrowland Adventure (eJOI19_adventure) C++14
100 / 100
 91 ms 6640 KB 
#include <iostream>
#include <string>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <vector>
#include <fstream>
#include <bitset>
#include <tuple>
#include <cmath>
#include <cstdint>
#include <stack>
#include <cassert>
#include <cstdio>
#include <queue>
#include <iterator>
#include <iomanip>
#include <algorithm>
#include <sstream>

#define long long int;
using namespace std;

int newVal(int nb, int dir) {
	if (nb > dir) return dir + (4 - nb);
	return dir - nb;
}

int r, c;
vector<vector<int>> grid;
vector<vector<int>> dist;
vector<vector<int>> visited;

pair<int, pair<int, int>> moves[4] = { { 0, {0, -1} }, { 1,{1, 0} }, { 2, {0, 1} }, { 3,{-1, 0} } };

signed main() {
	cin >> r >> c;
	grid.resize(c, vector<int>(r));
	dist.resize(c, vector<int>(r));
	visited.resize(c, vector<int>(r));

	for (int y = 0; y < r; y++)
	{
		for (int x = 0; x < c; x++)
		{
			char c;
			cin >> c;
			if (c == 'X') grid[x][y] = -1;
			else if (c == 'N') grid[x][y] = 0;
			else if (c == 'E') grid[x][y] = 1;
			else if (c == 'S') grid[x][y] = 2;
			else if (c == 'W') grid[x][y] = 3;
			dist[x][y] = 1000000000;
		}
	} 

	priority_queue<pair<int, pair<int,int>>> q;
	dist[0][0] = 0;
	q.push({ 0,{0,0 } });
	while (!q.empty()) {
		int x = q.top().second.first, y= q.top().second.second; q.pop();
		if (visited[x][y]) continue;
		visited[x][y] = true;
		if (grid[x][y] == -1)continue;
		for (int s = 0; s < 4; s++)
		{
			int i = x + moves[s].second.first; 
			int j = y + moves[s].second.second;
			if (i >= c || j >= r || min(i,j)<0) continue;

			int w = newVal(grid[x][y], moves[s].first);
			if (abs(dist[x][y]) + w < abs(dist[i][j])) {
				dist[i][j] = abs(dist[x][y]) + w;
				q.push({ -dist[i][j],{i,j} });
			}
		}
	}
	if (!visited[c - 1][r-1]) cout << -1 << "\n";
	else cout << dist[c-1][r-1] << "\n";
	return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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 340 KB Output is correct
6 Correct 1 ms 236 KB Output is correct
7 Correct 1 ms 212 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 300 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 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 340 KB Output is correct
6 Correct 1 ms 236 KB Output is correct
7 Correct 1 ms 212 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 300 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 300 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 300 KB Output is correct
20 Correct 1 ms 340 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 304 KB Output is correct
4 Correct 1 ms 212 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 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 304 KB Output is correct

Subtask #5
50.0 / 50.0

# 결과 실행 시간 메모리 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 340 KB Output is correct
6 Correct 1 ms 236 KB Output is correct
7 Correct 1 ms 212 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 300 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 300 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 300 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 304 KB Output is correct
28 Correct 1 ms 212 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 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 304 KB Output is correct
35 Correct 6 ms 636 KB Output is correct
36 Correct 1 ms 304 KB Output is correct
37 Correct 6 ms 568 KB Output is correct
38 Correct 2 ms 724 KB Output is correct
39 Correct 53 ms 3532 KB Output is correct
40 Correct 60 ms 3560 KB Output is correct
41 Correct 13 ms 3544 KB Output is correct
42 Correct 54 ms 3552 KB Output is correct
43 Correct 91 ms 6640 KB Output is correct
44 Correct 12 ms 3540 KB Output is correct