oj.uz

Submission #563657

# Submission time Handle Problem Language Result Execution time Memory
563657 2022-05-17T21:07:35 Z four_specks Crocodile's Underground City (IOI11_crocodile) C++17
89 / 100
 515 ms 77076 KB 
#include "crocodile.h"

#include <bits/stdc++.h>

using namespace std;

inline namespace
{
} // namespace

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
    vector<vector<pair<int, long>>> adj(N);
    for (int i = 0; i < M; i++)
        adj[R[i][0]].emplace_back(R[i][1], L[i]),
        adj[R[i][1]].emplace_back(R[i][0], L[i]);

    vector<array<long, 2>> dist(N, {LONG_MAX / 10, LONG_MAX / 10});

    priority_queue<pair<long, int>> pq;
    for (int i = 0; i < K; i++)
        pq.emplace(0, P[i]), dist[P[i]] = {0, 0};

    while (!pq.empty())
    {
        auto [d, u] = pq.top();
        pq.pop();

        if (-d != dist[u][1])
            continue;

        for (auto [v, w] : adj[u])
        {
            long cost = w - d;
            if (cost < dist[v][0])
                dist[v][1] = dist[v][0],
                dist[v][0] = cost;
            else if (cost < dist[v][1])
                dist[v][1] = cost;
            else
                continue;

            pq.emplace(-dist[v][1], v);
        }
    }

    assert(dist[0][1] <= 1'000'000'000);

    return dist[0][1];
}

Subtask #1
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 3 ms 852 KB Output is correct
13 Correct 3 ms 980 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 3 ms 852 KB Output is correct
13 Correct 3 ms 980 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 394 ms 67444 KB Output is correct
17 Correct 85 ms 16580 KB Output is correct
18 Correct 102 ms 18780 KB Output is correct
19 Correct 515 ms 77076 KB Output is correct
20 Correct 260 ms 52712 KB Output is correct
21 Correct 37 ms 7240 KB Output is correct
22 Incorrect 270 ms 48748 KB Output isn't correct
23 Halted 0 ms 0 KB -