| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 876791 | dimashhh | Cyberland (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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5;
double d[N][70],used[N][20];
double solve(int n, int m, int k, int h, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr)
{
vector<vector<pair<int,double>> g(n);
if(k >= 66){
k = 66;
}
for (int i = 0; i < n; i++)
{
for(int j = 0;j <= k;j++){
d[i][j] = 1e15;
used[i][j] = 0;
}
}
for (int i = 0; i < m; i++)
{
g[x[i]].epmlace_back({y[i], c[i]});
g[y[i]].emplace_back({x[i], c[i]});
}
queue<int> q;
vector<int> can(n,0);
can[0] = 1;
q.push(0);
priority_queue<pair<double,pair<int,int>>> st;
while(!q.empty()){
int v = q.front();
q.pop();
if(!can[v]) continue;
if((arr[v] == 0 || v == 0) && can[v]){
d[v][0] = 0;
st.push({0,{0,v}});
}
for(auto [to,w]:g[v]){
if(to == h || can[to]) continue;
q.push(to);
can[to] = 1;
}
}
st.push({0,{0,0}});
double res = 1e15;
while(!st.empty()){
double x = (st.top()).first;
auto [col,v] = (st.top()).second;
st.pop();
if(used[v][col]) continue;
used[v][col] = 1;
if(v == h){
res = min(res,d[v][col]);
continue;
}
for(auto [to,w]:g[v]){
if(to == h || !can[to]) continue;
if(d[to][col + 1] != -1 && col + 1 <= k && arr[to] == 2 && d[to][col + 1] > (d[v][col] + w) / 2){
d[to][col + 1] = (d[v][col] + w) / 2;
st.push({-d[to][col + 1],{col + 1,to}});
}
if(d[to][col] != -1 && d[to][col] > d[v][col] + w){
d[to][col] = d[v][col] + w;
st.push({-d[to][col],{col,to}});
}
}
d[v][col] = -1;
}
if(res == 1e15) res = -1;
return res;
}
// int main() {
// int T;
// assert(1 == scanf("%d", &T));
// while (T--){
// int N,M,K,H;
// assert(4 == scanf("%d %d %d\n%d", &N, &M, &K, &H));
// std::vector<int> x(M);
// std::vector<int> y(M);
// std::vector<int> c(M);
// std::vector<int> arr(N);
// for (int i=0;i<N;i++)
// assert(1 == scanf("%d", &arr[i]));
// for (int i=0;i<M;i++)
// assert(3 == scanf("%d %d %d", &x[i], &y[i], &c[i]));
// printf("%.12lf\n", solve(N, M, K, H, x, y, c, arr));
// }
// }