oj.uz

답안 #448524

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
448524 2021-07-30T11:24:32 Z mychecksedad Awesome Arrowland Adventure (eJOI19_adventure) C++17
100 / 100
 137 ms 26544 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int N = 510;
#define pii pair<int,int>
#define pb push_back
struct Edge{
    int x, y, w;
};

int n, m, dist[N][N];
char c;
vector<Edge> g[N][N];
bool vis[N][N];


int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    cin >> n >> m;
    int arr[4][2]={{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
    for(int i = 0; i <= n+2; i++) for(int j = 0; j <= m+2; j++) {dist[i][j] = 1e9; vis[i][j] = 0;}
    Edge e;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            cin >> c;
            int co;
            if(c == 'N'){
                co = 0;
                for(int k = 0; k < 4; k++){
                    e.x = i + arr[(k+co)%4][0];
                    e.y = j + arr[(k+co)%4][1];
                    e.w = k;
                    g[i][j].pb(e);
                }
            }else if(c == 'E'){
                co=1;
                for(int k = 0; k < 4; k++){
                    e.x = i + arr[(k+co)%4][0];
                    e.y = j + arr[(k+co)%4][1];
                    e.w = k;
                    g[i][j].pb(e);
                }
            }else if(c == 'S'){
                co=2;
                for(int k = 0; k < 4; k++){
                    e.x = i + arr[(k+co)%4][0];
                    e.y = j + arr[(k+co)%4][1];
                    e.w = k;
                    g[i][j].pb(e);
                }
            }else if(c == 'W'){
                co=3;
                for(int k = 0; k < 4; k++){
                    e.x = i + arr[(k+co)%4][0];
                    e.y = j + arr[(k+co)%4][1];
                    e.w = k;
                    g[i][j].pb(e);
                }
            }
        }   
    }
    dist[1][1] = 0;
    priority_queue<pair<int, pii>> q;
    q.push({0, {1, 1}});

    while(!q.empty()){
        int x = q.top().second.first, y = q.top().second.second;
        q.pop();
        if(vis[x][y]) continue;
        vis[x][y] = 1;
        for(Edge u: g[x][y]){
            if(dist[x][y] + u.w < dist[u.x][u.y]){
                dist[u.x][u.y] = dist[x][y] + u.w;
                q.push({-dist[u.x][u.y], {u.x, u.y}});
            }
        }
    }
    cout << (!vis[n][m] ? -1 : dist[n][m]);
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
16.0 / 16.0

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

Subtask #5
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6348 KB Output is correct
2 Correct 4 ms 6348 KB Output is correct
3 Correct 4 ms 6476 KB Output is correct
4 Correct 4 ms 6476 KB Output is correct
5 Correct 4 ms 6348 KB Output is correct
6 Correct 4 ms 6464 KB Output is correct
7 Correct 4 ms 6348 KB Output is correct
8 Correct 4 ms 6348 KB Output is correct
9 Correct 4 ms 6460 KB Output is correct
10 Correct 4 ms 6348 KB Output is correct
11 Correct 4 ms 6348 KB Output is correct
12 Correct 4 ms 6348 KB Output is correct
13 Correct 4 ms 6476 KB Output is correct
14 Correct 4 ms 6348 KB Output is correct
15 Correct 4 ms 6348 KB Output is correct
16 Correct 4 ms 6348 KB Output is correct
17 Correct 4 ms 6348 KB Output is correct
18 Correct 4 ms 6348 KB Output is correct
19 Correct 4 ms 6348 KB Output is correct
20 Correct 4 ms 6348 KB Output is correct
21 Correct 4 ms 6348 KB Output is correct
22 Correct 4 ms 6348 KB Output is correct
23 Correct 4 ms 6348 KB Output is correct
24 Correct 4 ms 6348 KB Output is correct
25 Correct 4 ms 6476 KB Output is correct
26 Correct 4 ms 6348 KB Output is correct
27 Correct 5 ms 6476 KB Output is correct
28 Correct 5 ms 6348 KB Output is correct
29 Correct 4 ms 6476 KB Output is correct
30 Correct 4 ms 6476 KB Output is correct
31 Correct 4 ms 6404 KB Output is correct
32 Correct 4 ms 6348 KB Output is correct
33 Correct 4 ms 6348 KB Output is correct
34 Correct 4 ms 6348 KB Output is correct
35 Correct 12 ms 7708 KB Output is correct
36 Correct 5 ms 6476 KB Output is correct
37 Correct 14 ms 8044 KB Output is correct
38 Correct 13 ms 9056 KB Output is correct
39 Correct 126 ms 20232 KB Output is correct
40 Correct 102 ms 20180 KB Output is correct
41 Correct 45 ms 20164 KB Output is correct
42 Correct 105 ms 20224 KB Output is correct
43 Correct 137 ms 26544 KB Output is correct
44 Correct 56 ms 20164 KB Output is correct