oj.uz

답안 #448521

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
448521 2021-07-30T11:15:00 Z mychecksedad Awesome Arrowland Adventure (eJOI19_adventure) C++17
34 / 100
 18 ms 28708 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int N = 1000;
#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-1; i++) for(int j = 0; j <= N-1; 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({-u.w, {u.x, u.y}});
            }
        }
    }
    cout << (!vis[n][m] ? -1 : dist[n][m]);
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 28692 KB Output is correct
2 Correct 16 ms 28616 KB Output is correct
3 Correct 16 ms 28640 KB Output is correct
4 Correct 16 ms 28620 KB Output is correct
5 Correct 16 ms 28640 KB Output is correct
6 Correct 16 ms 28608 KB Output is correct
7 Correct 16 ms 28612 KB Output is correct
8 Correct 16 ms 28620 KB Output is correct
9 Correct 16 ms 28668 KB Output is correct
10 Correct 16 ms 28620 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 28692 KB Output is correct
2 Correct 16 ms 28616 KB Output is correct
3 Correct 16 ms 28640 KB Output is correct
4 Correct 16 ms 28620 KB Output is correct
5 Correct 16 ms 28640 KB Output is correct
6 Correct 16 ms 28608 KB Output is correct
7 Correct 16 ms 28612 KB Output is correct
8 Correct 16 ms 28620 KB Output is correct
9 Correct 16 ms 28668 KB Output is correct
10 Correct 16 ms 28620 KB Output is correct
11 Correct 16 ms 28688 KB Output is correct
12 Correct 17 ms 28656 KB Output is correct
13 Correct 17 ms 28620 KB Output is correct
14 Correct 16 ms 28620 KB Output is correct
15 Correct 16 ms 28676 KB Output is correct
16 Correct 16 ms 28672 KB Output is correct
17 Correct 17 ms 28708 KB Output is correct
18 Correct 16 ms 28636 KB Output is correct
19 Correct 18 ms 28620 KB Output is correct
20 Correct 17 ms 28620 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 28652 KB Output is correct
2 Incorrect 17 ms 28696 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 28692 KB Output is correct
2 Correct 16 ms 28616 KB Output is correct
3 Correct 16 ms 28640 KB Output is correct
4 Correct 16 ms 28620 KB Output is correct
5 Correct 16 ms 28640 KB Output is correct
6 Correct 16 ms 28608 KB Output is correct
7 Correct 16 ms 28612 KB Output is correct
8 Correct 16 ms 28620 KB Output is correct
9 Correct 16 ms 28668 KB Output is correct
10 Correct 16 ms 28620 KB Output is correct
11 Correct 16 ms 28688 KB Output is correct
12 Correct 17 ms 28656 KB Output is correct
13 Correct 17 ms 28620 KB Output is correct
14 Correct 16 ms 28620 KB Output is correct
15 Correct 16 ms 28676 KB Output is correct
16 Correct 16 ms 28672 KB Output is correct
17 Correct 17 ms 28708 KB Output is correct
18 Correct 16 ms 28636 KB Output is correct
19 Correct 18 ms 28620 KB Output is correct
20 Correct 17 ms 28620 KB Output is correct
21 Correct 16 ms 28620 KB Output is correct
22 Correct 16 ms 28620 KB Output is correct
23 Correct 16 ms 28620 KB Output is correct
24 Correct 15 ms 28620 KB Output is correct
25 Correct 16 ms 28652 KB Output is correct
26 Incorrect 17 ms 28696 KB Output isn't correct
27 Halted 0 ms 0 KB -