Submission #1008156

#TimeUsernameProblemLanguageResultExecution timeMemory
1008156imarnCyberland (APIO23_cyberland)C++17
97 / 100
3047 ms195576 KiB
#include<bits/stdc++.h> #pragma GCC optimize("O3") #pragma GCC target("avx2") #define ll long long #define pii pair<int,int> #define pll pair<ll,ll> #define plx pair<ll,int> #define f first #define s second #define pb push_back #define all(x) x.begin(),x.end() #define vi vector<int> using namespace std; const int mxn=1e5+5; vector<pair<int,double>>g[mxn]; double d[70][mxn]{0}; bool vis[mxn]{0}; void dfs(int u,int n){ vis[u]=1; for(auto v:g[u]){ if(v.f==n||vis[v.f])continue; dfs(v.f,n); } } 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){ K=min(K,69);for(int i=0;i<M;i++)g[x[i]].pb({y[i],c[i]}),g[y[i]].pb({x[i],c[i]});dfs(0,H); for(int i=0;i<=K;i++)for(int j=0;j<N;j++)d[i][j]=1e17; priority_queue<pair<double,pii>,vector<pair<double,pii>>,greater<pair<double,pii>>>q;d[0][0]=0;q.push({0,{0,0}}); for(int i=1;i<N;i++)if(arr[i]==0&&vis[i])d[0][i]=0,q.push({0,{0,i}}); while(!q.empty()){ auto u=q.top();q.pop(); if(d[u.s.f][u.s.s]<u.f)continue; if(u.s.s==H)continue; for(auto v:g[u.s.s]){ if(d[u.s.f][v.f]>u.f+v.s)d[u.s.f][v.f]=u.f+v.s,q.push({u.f+v.s,{u.s.f,v.f}}); if(arr[v.f]==2&&u.s.f<K){ double t = (u.f+v.s)/2; if(d[u.s.f+1][v.f]>t)d[u.s.f+1][v.f]=t,q.push({t,{u.s.f+1,v.f}}); } } }double ans=1e17; for(int i=0;i<=K;i++)ans=min(ans,d[i][H]); for(int i=0;i<N;i++)g[i].clear();memset(vis,0,sizeof vis); return (ans>=1e17?-1:ans); }

Compilation message (stderr)

cyberland.cpp: In function 'double solve(int, int, int, int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
cyberland.cpp:43:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   43 |     for(int i=0;i<N;i++)g[i].clear();memset(vis,0,sizeof vis);
      |     ^~~
cyberland.cpp:43:38: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   43 |     for(int i=0;i<N;i++)g[i].clear();memset(vis,0,sizeof vis);
      |                                      ^~~~~~
#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...