oj.uz

답안 #742556

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
742556 2023-05-16T12:59:17 Z bogdanvladmihai Awesome Arrowland Adventure (eJOI19_adventure) C++14
100 / 100
 432 ms 12336 KB 
#include <iostream>
#include <vector>
#include <queue>
#include <utility>
#include <limits.h>
#include <tuple>

const std::vector<std::pair<int, int>> dirs = {{0, -1}, {-1, 0}, {0, 1}, {1, 0}};

inline bool inside(int x, int y, int N, int M) {
    return x >= 0 && y >= 0 && x < N && y < M;
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);

    int N, M;
    std::cin >> N >> M;
    std::vector<std::string> mat(N);
    for (auto &line : mat) {
        std::cin >> line;
    }
    std::vector<std::queue<std::pair<int, int>>> Q(4);
    std::vector<std::vector<int>> dist(N, std::vector<int>(M, INT_MAX / 2));
    if (mat[0][0] != 'X') {
        dist[0][0] = 0;
        Q[0].emplace(0, 0);
    }

    auto getTop = [&]() {
        for (int i = 0; i < 4; i++) {
            if (!Q[i].empty()) {
                auto answer = Q[i].front();
                Q[i].pop();
                return answer;
            }
        }
        return std::make_pair(-1, -1);
    };

    while (true) {
        int x, y;
        std::tie(x, y) = getTop();
        if (x == -1) {
            break;
        }
        int j = 0;
        switch (mat[x][y]) {
            case 'N':
                j = 1;
                break;
            case 'E':
                j = 2;
                break;
            case 'S':
                j = 3;
                break;
        }
        for (int i = 0; i < 4; i++) {
            int nx = x + dirs[(i + j) % 4].first, ny = y + dirs[(i + j) % 4].second;
            if (inside(nx, ny, N, M) && dist[nx][ny] > dist[x][y] + i) {
                dist[nx][ny] = dist[x][y] + i;
                if (mat[nx][ny] != 'X') {
                    Q[i].emplace(nx, ny);
                }
            }
        }
    }
    std::cout << (dist[N - 1][M - 1] < INT_MAX / 2 ? dist[N - 1][M - 1] : -1) << "\n";
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 244 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 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 0 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 0 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
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #5
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 244 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 23 ms 892 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 16 ms 796 KB Output is correct
38 Correct 1 ms 564 KB Output is correct
39 Correct 293 ms 8432 KB Output is correct
40 Correct 432 ms 12336 KB Output is correct
41 Correct 2 ms 1748 KB Output is correct
42 Correct 286 ms 8188 KB Output is correct
43 Correct 14 ms 3768 KB Output is correct
44 Correct 1 ms 1748 KB Output is correct