제출 #1007175

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1007175		The_Samurai	Crocodile's Underground City (IOI11_crocodile)	C++17	100 / 100	364 ms	65544 KiB

crocodile

#include "crocodile.h"
#include "bits/stdc++.h"
using namespace std;
const int inf = 2e9;

int travel_plan(int n, int m, int R[][2], int L[], int k, int p[]) {
    vector<vector<pair<int, int>>> g(n);
    for (int i = 0; i < m; i++) {
        g[R[i][0]].emplace_back(R[i][1], L[i]);
        g[R[i][1]].emplace_back(R[i][0], L[i]);
    }
    vector<int> height(n, -1);
    vector<pair<int, int>> out(n, make_pair(inf, inf));
    priority_queue<pair<int, int>> pq;
    vector<bool> vis(n);
    for (int i = 0; i < k; i++) {
        height[p[i]] = 0;
        pq.emplace(0, p[i]);
    }
    while (!pq.empty()) {
        auto [d, u] = pq.top(); pq.pop();
        if (vis[u]) continue;
        d *= -1;
        // cout << u << ' ' << d << endl;
        vis[u] = true;
        height[u] = d;
        for (auto [v, w]: g[u]) {
            if (vis[v]) continue;
            // cout << '\t' << u << ' ' << v << ' ' << w << endl;
            if (out[v].first > d + w) {
                out[v].second = out[v].first;
                out[v].first = d + w;
            } else {
                out[v].second = min(out[v].second, d + w);
            }
            if (out[v].second != inf) {
                pq.emplace(-out[v].second, v);
            }
        }
    }
    return height[0];
}

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