| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 752480 | bachhoangxuan | 사이버랜드 (APIO23_cyberland) | 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 "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define pdi pair<double,pii>
#define fi first
#define se second
double solve(int N, int M, int K, int T, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr) {
K=min(K,100);
vector<vector<double>> dist(N,vector<double>(K+1,1e14));
vector<vector<pii>> edge(N);
for(int i=0;i<M;i++){
edge[x[i]].push_back({y[i],c[i]});
edge[y[i]].push_back({x[i],c[i]});
}
priority_queue<pdi,vector<pdi>,greater<pdi>> pq;
dist[0][0]=0;pq.push({0,{0,0}});
bool ok=false;
int res=1e14;
while(!pq.empty()){
auto [d,x]=pq.top();pq.pop();
int u=x.fi,k=x.se;
if(u==T){
res=min(res,d);
ok=true;continue;
}
for(auto [v,w]:edge[u]){
double nd=dist[u][k]*(arr[u]?1.0/arr[u]:0)+w;
int nk=k+(arr[u]==2);
if(nk<=k && dist[v][nk]>nd){
dist[v][nk]=nd;
pq.push({nd,{v,nk}});
}
if(dist[u][k]+w<dist[v][k]){
dist[v][k]=dist[u][k]+w;
pq.push({dist[u][k]+w,{v,k}});
}
}
}
if(ok) return res;
else return -1;
}