# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
543205 | __Variatto | Crocodile's Underground City (IOI11_crocodile) | C++17 | 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 <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define ll long long
const ll MAX=1e5+10, MAXV=1e18;
int n, m, k, ileSpe[MAX], odw[MAX];
ll odl[MAX];
bool spe[MAX];
vector<pair<int,int>>g[MAX];
priority_queue<pair<ll,int>>kol;
ll obl(int x){
set<ll>se;
for(auto s: g[x])
if(spe[s.fi])
se.insert(odl[s.fi]+s.se);
se.erase(se.begin());
return(*se.begin());
}
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
n=N, k=K, m=M;
for(int i=1; i<=m; i++)
g[R[i-1][0]+1].pb({R[i-1][1]+1, L[i-1]}), g[R[i-1][1]+1].pb({R[i-1][0]+1, L[i-1]});
for(int i=1; i<=k; i++){
int v=P[i-1]+1;
spe[v]=true;
}
for(int i=1; i<=n; i++){
odl[i]=MAXV;