# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
599744 | Meloric | Crocodile's Underground City (IOI11_crocodile) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "crocodile.h"
#include <bits/stdc++.h>
#define pb push_back
//#define int int64_t
#define pii pair<int, int>
#define X first
#define Y second
#define all(x) (x).begin(),(x).end()
#define lb lower_bound
#define ub upper_bound
using namespace std;
void p(auto A){
for(auto e : A)cout << e << ' ';
cout << '\n';
}
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
/*
int n, m, k; cin >> n >> m >> k;
vector<vector<int>>R(m, vector<int>(2));
vector<int>L(m), P(k);
for(int i = 0; i< m; i++)cin >> R[i][0] >> R[i][1] >> L[i];
for(int i = 0; i< k; i++)cin >> P[i];
*/
vector<vector<pii>> g(n, vector<pii>());
for(int i = 0; i< m; i++){
int c = R[i][0];
int d = R[i][1];
int w = L[i];
g[c].pb({d, w});
g[d].pb({c, w});
}
vector<int>v1(n,-1), v2(n,-1);
priority_queue<pii> pq;
for(int i = 0; i< k; i++){
int c = P[i];
v1[c] = 0;
pq.push({0, c});
}
while(pq.size()){
auto [d, u] = pq.top(); d = -d;
pq.pop();
if(v2[u] != -1)continue;
if(v1[u] == -1){
v1[u] = d;
continue;
}
v2[u] = d;
for(auto [v, w] : g[u])pq.push({-(w+d), v});
}
return v2[0];
}
/*
void solve(){
cout << travel_plan();
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
//cin >> t;
while(t--)solve();
}
*/