# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1268510 | m_mondzik | Crocodile's Underground City (IOI11_crocodile) | C++20 | 0 ms | 0 KiB |
#include "crocodile.h"
#include<bits/stdc++.h>
#define F first
#define S second
using namespace std;
int travel_plan(int N, int M, int K, int R[][2], int L[], int P[]){
vector<pair<int, int>> graph[N];
for (int i = 0; i < M; i++) {
graph[R[i][0]].push_back({R[i][1], L[i]});
graph[R[i][1]].push_back({R[i][0], L[i]});
}
int degree[N];
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> Q;
vector<pair<long long, long long>> mini(N, {1e18, 1e18});
for (int i = 0; i < K; i++){
degree[P[i]] = 2;
Q.push({0, P[i]});
mini[P[i]] = {0, 0};
}
while (!Q.empty()){
pair<int, int> v = Q.top();
Q.pop();
for (auto i: graph[v.S]){
degree[i.F]++;
if (mini[v.S].S + i.S < mini[i.F].F) mini[i.F].S = mini[i.F].F, mini[i.F].F = mini[v.S].S + i.S;
else if (mini[v.S].S + i.S < mini[i.F].S) mini[i.F].S = mini[v.S].S + i.S;
if (degree[i.F] == 2) Q.push({mini[i.F].S, i.F});
}
}
return (int)mini[0].S;
}