oj.uz

Submission #630418

# Submission time Handle Problem Language Result Execution time Memory
630418 2022-08-16T10:46:19 Z NintsiChkhaidze Crocodile's Underground City (IOI11_crocodile) C++14
89 / 100
 497 ms 77452 KB 
#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
#define s second
#define pb push_back
#define ll long long
#define f first
 
const int nn = 100005;
vector <pair<int,ll> > v[nn];
pair<ll,ll> dis[nn];

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
    for (int i = 0; i < M; i++){
        v[R[i][0]].pb({R[i][1],L[i]});
        v[R[i][1]].pb({R[i][0],L[i]});
    }
    for (int i=0;i<N; i++)
        dis[i] = {1e18,1e18};
 
    using T = pair<ll,int>;
    priority_queue <T, vector <T>, greater <T>> pq;
    for (int i = 0; i < K; i++)
        dis[P[i]] = {0LL,0LL},pq.push({0LL,P[i]});
 
    while(pq.size()){
        ll d = pq.top().f;
        int x = pq.top().s;
        pq.pop();
        if (d != dis[x].s) continue;
        for (auto [to,w]: v[x]){
            ll vl = w + d;
            if (dis[to].f > vl) {
                dis[to].s = dis[to].f;
                dis[to].f = vl;
                pq.push({dis[to].s, to});
            }else if (dis[to].s > vl){
                dis[to].s = vl;
                pq.push({dis[to].s, to});
            }
            
        }
    }
    return dis[0].s;
}

Compilation message

crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:31:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   31 |         for (auto [to,w]: v[x]){
      |                   ^

Subtask #1
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2660 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2804 KB Output is correct
5 Correct 2 ms 2800 KB Output is correct
6 Correct 2 ms 2672 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2660 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2804 KB Output is correct
5 Correct 2 ms 2800 KB Output is correct
6 Correct 2 ms 2672 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 3 ms 3068 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 6 ms 3368 KB Output is correct
13 Correct 4 ms 3412 KB Output is correct
14 Correct 2 ms 2668 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2660 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2804 KB Output is correct
5 Correct 2 ms 2800 KB Output is correct
6 Correct 2 ms 2672 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 3 ms 3068 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 6 ms 3368 KB Output is correct
13 Correct 4 ms 3412 KB Output is correct
14 Correct 2 ms 2668 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct
16 Correct 381 ms 69200 KB Output is correct
17 Correct 82 ms 16784 KB Output is correct
18 Correct 106 ms 19056 KB Output is correct
19 Correct 497 ms 77452 KB Output is correct
20 Correct 261 ms 55404 KB Output is correct
21 Correct 37 ms 9236 KB Output is correct
22 Incorrect 266 ms 50836 KB Output isn't correct
23 Halted 0 ms 0 KB -