oj.uz

답안 #919443

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
919443 2024-01-31T19:04:46 Z raphaelp Awesome Arrowland Adventure (eJOI19_adventure) C++14
100 / 100
 88 ms 15604 KB 
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int M, N;
    cin >> M >> N;
    vector<string> Tab(M);
    for (int i = 0; i < M; i++)
    {
        cin >> Tab[i];
        for (int j = 0; j < N; j++)
        {
            if (Tab[i][j] == 'W')
                Tab[i][j] = '0';
            if (Tab[i][j] == 'N')
                Tab[i][j] = '3';
            if (Tab[i][j] == 'E')
                Tab[i][j] = '2';
            if (Tab[i][j] == 'S')
                Tab[i][j] = '1';
        }
    }
    vector<vector<int>> occ(M, vector<int>(N, 1000000000));
    priority_queue<vector<int>> Q;
    vector<int> transX = {0, -1, 0, 1}, transY = {-1, 0, 1, 0}, co = {2, 3, 0, 1};
    Q.push({0, M - 1, N - 1});
    occ[M - 1][N - 1] = 0;
    while (!Q.empty())
    {
        int x = Q.top()[1];
        int y = Q.top()[2];
        int dist = -Q.top()[0];
        Q.pop();
        if (dist > occ[x][y])
            continue;
        if (x == 0 && y == 0)
        {
            cout << dist;
            return 0;
        }

        for (int i = 0; i < 4; i++)
        {
            if (x + transX[i] < 0 || x + transX[i] >= M || y + transY[i] < 0 || y + transY[i] >= N)
                continue;
            if (Tab[x + transX[i]][y + transY[i]] == 'X')
                continue;
            int cost = (co[i] + Tab[x + transX[i]][y + transY[i]] - '0') % 4;
            if (dist + cost < occ[x + transX[i]][y + transY[i]])
            {
                occ[x + transX[i]][y + transY[i]] = dist + cost;
                Q.push({-dist - cost, x + transX[i], y + transY[i]});
            }
        }
    }
    cout << -1;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
16.0 / 16.0

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

Subtask #5
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 1 ms 428 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 452 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 6 ms 600 KB Output is correct
38 Correct 9 ms 600 KB Output is correct
39 Correct 63 ms 2136 KB Output is correct
40 Correct 58 ms 2136 KB Output is correct
41 Correct 60 ms 2136 KB Output is correct
42 Correct 58 ms 2196 KB Output is correct
43 Correct 88 ms 15604 KB Output is correct
44 Correct 59 ms 2136 KB Output is correct