Submission #1081413

#TimeUsernameProblemLanguageResultExecution timeMemory
1081413MuhammetCyberland (APIO23_cyberland)C++17
97 / 100
3031 ms91792 KiB
#include <bits/stdc++.h> #include "cyberland.h" // #include "stub.cpp" using namespace std; #define lb long double #define ll long long #define ff first #define ss second double solve(int n, int m, int k, int h, vector<int> x, vector<int> y, vector<int> c, vector<int> a) { vector <pair<ll, ll>> v[n+5]; k = min(k,64); for(int i = 0; i < m; i++){ v[x[i]].push_back({y[i],c[i]}); v[y[i]].push_back({x[i],c[i]}); } priority_queue <pair<lb,pair<ll,ll>>> q; q.push({0,{0,0}}); vector <vector<lb>> dis(n+1, vector<lb> (k+1,1e18)); dis[0][0] = 0; while(!q.empty()){ auto [w,x] = q.top(); q.pop(); if(-w != dis[x.ff][x.ss]) continue; if(x.ff == h) continue; for(auto [to,w1] : v[x.ff]){ if(a[to] == 2 and x.ss < k){ lb w2 = w1; if((dis[x.ff][x.ss] + w2) / 2 < dis[to][x.ss+1]){ dis[to][x.ss+1] = (dis[x.ff][x.ss] + w2) / 2; q.push({-dis[to][x.ss+1],{to,x.ss+1}}); } } if((dis[to][x.ss] > dis[x.ff][x.ss] + w1) or (a[to] == 0 and dis[to][x.ss] != 0)){ dis[to][x.ss] = dis[x.ff][x.ss] + w1; if(a[to] == 0) dis[to][x.ss] = 0; q.push({-dis[to][x.ss],{to,x.ss}}); } } } lb ans = 1e18; for(int i = 0; i <= k; i++){ ans = min(ans,dis[h][i]); } if(ans == 1e18) return -1; return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...