Submission #564219

#	Time	Username	Problem	Language	Result	Execution time	Memory
564219		four_specks	Crocodile's Underground City (IOI11_crocodile)	C++17	100 / 100	468 ms	63092 KiB

crocodile

#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, int>>> 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<int, 2>> dist(N, {INT_MAX, INT_MAX});

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

    for (vector<bool> done(N, 0); !done[0];)
    {
        auto [d, u] = pq.top();
        pq.pop();

        if (done[u])
            continue;

        done[u] = 1;

        for (auto [v, w] : adj[u])
        {
            int 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);
        }
    }

    return dist[0][1];
}

• Subtask 1: 46 / 46
• Subtask 2: 43 / 43
• Subtask 3: 11 / 11