oj.uz

답안 #459304

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
459304 2021-08-08T11:45:07 Z lukadupli Awesome Arrowland Adventure (eJOI19_adventure) C++14
100 / 100
 277 ms 18244 KB 
#include <bits/stdc++.h>

#define f first
#define s second

using namespace std;

const int MAX = 505, INF = 2e9;

typedef pair <int, int> pii;

int n, m, mat[MAX][MAX], sol[MAX][MAX];

set <pair <int, pii>> dijk;

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};

int main()
{
    cin >> n >> m;
    for(int i = 0; i < n; i++){
        string row;
        cin >> row;

        for(int j = 0; j < m; j++){
            if(row[j] == 'N') mat[i][j] = 0;
            else if(row[j] == 'E') mat[i][j] = 1;
            else if(row[j] == 'S') mat[i][j] = 2;
            else if(row[j] == 'W') mat[i][j] = 3;
            else mat[i][j] = -1;

            if(i > 0 || j > 0){
                sol[i][j] = INF;
                dijk.insert({INF, {i, j}});
            }
        }
    }
    dijk.insert({0, {0, 0}});

    while(!dijk.empty()){
        auto now = *dijk.begin();
        dijk.erase(now);

        int x = now.s.f, y = now.s.s;
        if(mat[x][y] == -1) continue;

        for(int i = 0; i < 4; i++){
            int nx = x + dx[i], ny = y + dy[i];

            if(nx >= 0 && nx < n && ny >= 0 && ny < m){
                int new_val = sol[x][y];

                if(i >= mat[x][y]) new_val += (i - mat[x][y]);
                else new_val += (i + 4 - mat[x][y]);

                if(new_val < sol[nx][ny]){
                    dijk.erase({sol[nx][ny], {nx, ny}});
                    sol[nx][ny] = new_val;
                    dijk.insert({sol[nx][ny], {nx, ny}});
                }
            }
        }

        /*cout << x << ' ' << y << '\n';

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++) cout << sol[i][j] << ' ';
            cout << '\n';
        }

        cout << '\n';*/
    }

    if(sol[n - 1][m - 1] >= INF) cout << -1;
    else cout << sol[n - 1][m - 1];

    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
16.0 / 16.0

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

Subtask #5
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 1 ms 304 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 304 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 300 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 20 ms 1868 KB Output is correct
36 Correct 1 ms 460 KB Output is correct
37 Correct 24 ms 2412 KB Output is correct
38 Correct 18 ms 3928 KB Output is correct
39 Correct 270 ms 18076 KB Output is correct
40 Correct 271 ms 18244 KB Output is correct
41 Correct 120 ms 18116 KB Output is correct
42 Correct 277 ms 18160 KB Output is correct
43 Correct 240 ms 18016 KB Output is correct
44 Correct 121 ms 18160 KB Output is correct