oj.uz

답안 #642042

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
642042 2022-09-18T10:37:57 Z Theo830 Awesome Arrowland Adventure (eJOI19_adventure) C++17
100 / 100
 102 ms 21436 KB 
#include<bits/stdc++.h>
using namespace std;

typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
priority_queue<ii,vector<ii>, greater<ii>> pq;
#define INF 100000000
vector<vii> graph;
vi dist;

void dijkstra(int s){
    dist[s] = 0;
    pq.push(ii(0,s));

    while(!pq.empty()){
        ii front = pq.top();
        pq.pop();
        int w = front.first;
        int u = front.second;

        if(w>dist[u]){
            continue;
        }

        for(int i=0; i<graph[u].size(); i++){
            ii v = graph[u][i];

            if(dist[u]+v.second<dist[v.first]){
                dist[v.first] = dist[u]+v.second;
                pq.push(ii(dist[v.first], v.first));
            }
        }
    }
}

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

    graph.assign(m*n, vii());
    dist.assign(m*n,INF);

    char arr[m][n];

    for(int i=0; i<m; i++){
        for(int j=0; j<n; j++){
           cin >> arr[i][j];
        }
    }

    vector<map<char,int>> mp = {{{'N',0},{'E',3},{'S',2},{'W',1}}, {{'N',1},{'E',0},{'S',3},{'W',2}}, {{'N',2},{'E',1},{'S',0},{'W',3}} , {{'N',3},{'E',2},{'S',1},{'W',0}}};
    int k = 0;

    for(int i=0; i<m; i++){
        for(int j=0; j<n; j++){
          if(j-1>=0 && arr[i][j]!='X') graph[k].push_back(ii(k-1,mp[3][arr[i][j]]));
          if(j+1<n && arr[i][j] !='X')  graph[k].push_back(ii(k+1,mp[1][arr[i][j]]));
          if(i-1>=0 && arr[i][j] !='X') graph[k].push_back(ii(k-n,mp[0][arr[i][j]]));
          if(i+1<m && arr[i][j]!='X')  graph[k].push_back(ii(k+n,mp[2][arr[i][j]]));
          k++;
        }
    }

    dijkstra(0);


    if(dist[(n*m)-1]!=INF) cout << dist[(n*m)-1];
    else cout << "-1";
}

Compilation message

adventure.cpp: In function 'void dijkstra(int)':
adventure.cpp:26:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |         for(int i=0; i<graph[u].size(); i++){
      |                      ~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
16.0 / 16.0

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

Subtask #5
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 296 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 292 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 296 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 296 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 300 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 300 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 7 ms 1748 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 9 ms 2004 KB Output is correct
38 Correct 8 ms 3028 KB Output is correct
39 Correct 89 ms 17076 KB Output is correct
40 Correct 102 ms 17008 KB Output is correct
41 Correct 45 ms 16972 KB Output is correct
42 Correct 82 ms 16980 KB Output is correct
43 Correct 102 ms 21436 KB Output is correct
44 Correct 48 ms 17064 KB Output is correct