oj.uz

답안 #868183

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
868183 2023-10-30T16:42:41 Z mariza Awesome Arrowland Adventure (eJOI19_adventure) C++14
100 / 100
 81 ms 19400 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

#define N 200001
#define INF 1000000001

#define MID ((l+r)/2)
#define RANGE (r-l+1)

int main() {
    ll n, m;
    cin>>n>>m;

    char c;
    ll u[n][m], r[n][m], d[n][m], l[n][m];
    for(ll i=0; i<n; i++){
        for(ll j=0; j<m; j++){
            cin>>c;
            if(c=='N'){
                u[i][j]=0;
                r[i][j]=1;
                d[i][j]=2;
                l[i][j]=3;
            }
            else if(c=='E'){
                u[i][j]=3;
                r[i][j]=0;
                d[i][j]=1;
                l[i][j]=2;
            }
            else if(c=='S'){
                u[i][j]=2;
                r[i][j]=3;
                d[i][j]=0;
                l[i][j]=1;
            }
            else if(c=='W'){
                u[i][j]=1;
                r[i][j]=2;
                d[i][j]=3;
                l[i][j]=0;
            }
            else{
                u[i][j]=INF;
                r[i][j]=INF;
                d[i][j]=INF;
                l[i][j]=INF;
            }
            if(i==0){
                u[i][j]=INF;
            }
            else if(i==n-1){
                d[i][j]=INF;
            }
            if(j==0){
                l[i][j]=INF;
            }
            else if(j==m-1){
                r[i][j]=INF;
            }
        }
    }

    priority_queue <pair<ll,pair<ll,ll>>> q; q.push({0,{0,0}});
    ll dist[n][m];
    for(ll i=0; i<n; i++){
        for(ll j=0; j<m; j++){
            dist[i][j]=INF;
        }
    }
    dist[0][0]=0;
    ll pr[n][m]={};

    while(!q.empty()){
        ll i=q.top().second.first;
        ll j=q.top().second.second;
        q.pop();

        if(pr[i][j]){
            continue;
        }
        pr[i][j]=true;

        if(i>0 && dist[i][j]+u[i][j]<dist[i-1][j]){
            dist[i-1][j]=dist[i][j]+u[i][j];
            q.push({-(dist[i][j]+u[i][j]),{i-1,j}});
        }
        if(i<n-1 && dist[i][j]+d[i][j]<dist[i+1][j]){
            dist[i+1][j]=dist[i][j]+d[i][j];
            q.push({-(dist[i][j]+d[i][j]),{i+1,j}});
        }
        if(j>0 && dist[i][j]+l[i][j]<dist[i][j-1]){
            dist[i][j-1]=dist[i][j]+l[i][j];
            q.push({-(dist[i][j]+l[i][j]),{i,j-1}});
        }
        if(j<m-1 && dist[i][j]+r[i][j]<dist[i][j+1]){
            dist[i][j+1]=dist[i][j]+r[i][j];
            q.push({-(dist[i][j]+r[i][j]),{i,j+1}});
        }
//        for(ll i1=0; i1<n; i1++){
//            for(ll j1=0; j1<m; j1++){
//                cout<<setw(3)<<((dist[i1][j1]<INF)?dist[i1][j1]:-1);
//            }
//            cout<<endl;
//        }
//        cout<<endl<<q.top().first<<" "<<q.top().second.first<<" "<<q.top().second.second<<endl;
    }


    cout<<((dist[n-1][m-1]<INF)?dist[n-1][m-1]:-1);

    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
16.0 / 16.0

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

Subtask #5
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 600 KB Output is correct
10 Correct 1 ms 500 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 600 KB Output is correct
35 Correct 5 ms 1372 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 6 ms 1624 KB Output is correct
38 Correct 5 ms 2396 KB Output is correct
39 Correct 58 ms 12380 KB Output is correct
40 Correct 58 ms 12476 KB Output is correct
41 Correct 18 ms 12332 KB Output is correct
42 Correct 59 ms 12340 KB Output is correct
43 Correct 81 ms 19400 KB Output is correct
44 Correct 21 ms 12380 KB Output is correct