oj.uz

답안 #906730

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
906730 2024-01-14T21:47:38 Z JellyTheOctopus Awesome Arrowland Adventure (eJOI19_adventure) C++17
100 / 100
 142 ms 16828 KB 
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second

const int MOD = 1e9+7;

int M, N;
int arr[501][501];
int addX[4] = {-1, 0, 1, 0};
int addY[4] = {0, 1, 0, -1};
int minDist[501][501];
bool seen[501][501];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> M >> N;
    for (int i = 1; i <= M; i++) {
        string s;
        cin >> s;
        for (int j = 1; j <= N; j++) {
            if (s[j-1] == 'X') arr[i][j] = -1;
            if (s[j-1] == 'N') arr[i][j] = 0;
            if (s[j-1] == 'E') arr[i][j] = 1;
            if (s[j-1] == 'S') arr[i][j] = 2;
            if (s[j-1] == 'W') arr[i][j] = 3;
            minDist[i][j] = (1<<30);
        }
    }
    priority_queue<pair<int, pair<int, int>>> q;
    q.push({0, {1, 1}});
    while (!q.empty()) {
        int x = q.top().se.fi;
        int y = q.top().se.se;
        int val = q.top().fi;
        q.pop();
        if (x < 1 || x > M || y < 1 || y > N) continue;
        if (seen[x][y]) continue;
        seen[x][y] = true;
        minDist[x][y] = -val;
        if (arr[x][y] == -1) continue;
        for (int i = 0; i <= 3; i++) {
            int x2, y2;
            x2 = x+addX[(arr[x][y]+i) % 4];
            y2 = y+addY[(arr[x][y]+i) % 4];
            q.push({-(minDist[x][y]+i), {x2, y2}});
        }
    }
    if (minDist[M][N] == (1<<30)) minDist[M][N] = -1;
    cout << minDist[M][N] << "\n";
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2428 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2428 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2432 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct

Subtask #5
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2428 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2432 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2392 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2496 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 9 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 11 ms 2604 KB Output is correct
38 Correct 1 ms 2396 KB Output is correct
39 Correct 108 ms 3004 KB Output is correct
40 Correct 102 ms 2908 KB Output is correct
41 Correct 3 ms 2652 KB Output is correct
42 Correct 102 ms 2952 KB Output is correct
43 Correct 142 ms 16828 KB Output is correct
44 Correct 3 ms 2652 KB Output is correct