# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1056819 | PikachudoraEHE | Crocodile's Underground City (IOI11_crocodile) | C++14 | 231 ms | 64976 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 pii pair<int,int>
#define fi first
#define se second
using namespace std;
const int N = 1e5+5;
vector<pii>adj[N];pii dp[N];int vis[N];
priority_queue<pii,vector<pii>,greater<pii>>pq;
int travel_plan(int n, int m, int R[][2], int L[], int K, int P[]){
for(int i=0;i<m;i++){
int u = R[i][0];int v=R[i][1];int w = L[i];
/*pii a;
auto &[x,y]=a;
cin >> x >> y;*/
adj[u].push_back({v,w});
adj[v].push_back({u,w});
}
for(int i=0;i<n;i++){
dp[i]={INT_MAX,INT_MAX};
}
for(int i=0;i<K;i++){
dp[P[i]]={0,0};
pq.push({0,P[i]});
}
while(!pq.empty()){
auto[ww,u]=pq.top();
pq.pop();
if(vis[u])continue;
vis[u]=1;
for(auto[v,w]:adj[u]){
if(ww+w<dp[v].se){
dp[v].se=ww+w;
if(ww+w<dp[v].fi)swap(dp[v].fi,dp[v].se);
if(dp[v].se<INT_MAX)pq.push({dp[v].se,v});
}
}
}
return dp[0].se;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |