Submission #758079

#	Time	Username	Problem	Language	Result	Execution time	Memory
758079		Blagoj	Crocodile's Underground City (IOI11_crocodile)	C++14	100 / 100	483 ms	72220 KiB

crocodile

#include "crocodile.h"
#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define ll long long
#define all(x) x.begin(), x.end()

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
    int n = N, m = M, k = K;
    vector<pair<int, int>> g[n + 2];
    for (int i = 0; i < m; i++) {
        g[R[i][0]].push_back({R[i][1], L[i]});
        g[R[i][1]].push_back({R[i][0], L[i]});
    }
    int vis[n + 2];
    memset(vis, 0, sizeof(vis));
    priority_queue<pair<ll, int>> pq;
    for (int i = 0; i < k; i++) {
        vis[P[i]] = 1;
        pq.push({0, P[i]});
    }
    ll ans = 0;
    while (pq.size() > 0) {
        auto x = pq.top();
        pq.pop();
        x.first *= -1;
        if (vis[x.second] == 0) {
            vis[x.second] = 1;
            continue;
        }
        if (vis[x.second] == 2) continue;
        if (x.second == 0) {
            ans = x.first;
            break;
        }
        vis[x.second] = 2;
        for (auto y : g[x.second]) {
            if (vis[y.first] == 2) continue;
            pq.push({-(x.first + y.second), y.first});
        }
    }
    return ans;
}

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