제출 #939299

#제출 시각아이디문제언어결과실행 시간메모리
939299tamir1사이버랜드 (APIO23_cyberland)C++17
8 / 100
3018 ms26832 KiB
#include "cyberland.h" #include <bits/stdc++.h> #include <vector> #define ff first #define ss second #define ll long long #define pp pair<ll,ll> const double INF=1e18; using namespace std; ll h,i,j; vector<pp> v[200001]; bitset<200005> vis; priority_queue<pair<pair<double,ll>,ll>> q; double dp[200001][31],dist; void dfs(ll a){ if(a==h) return; if(vis[a]) return; vis[a]=1; for(pp l:v[a]){ dfs(l.ff); } } 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) { h=H; dist=INF; dfs(1); for(i=0;i<M;i++){ v[x[i]].push_back({y[i],c[i]}); v[y[i]].push_back({x[i],c[i]}); } q.push({{(double)0,K},0}); for(i=0;i<N;i++){ if(vis[i] && !arr[i]) q.push({{(double)0,K},i}); for(j=0;j<=K;j++){ dp[i][j]=INF; } } while(!q.empty()){ ll a=q.top().ss; ll t=q.top().ff.ss; ll d=q.top().ff.ff; q.pop(); if(dp[a][t]<INF) continue; dp[a][t]=-1*d; for(pp l:v[a]){ q.push({{d-l.ss,t},l.ff}); if(arr[a]==2 && t>0){ q.push({{d/2-l.ss,t-1},l.ff}); } } } vis.reset(); for(i=0;i<N;i++){ v[i].clear(); } for(j=0;j<=K;j++){ if(dp[H][j]!=INF) dist=min(dist,dp[H][j]); } return dist; }
#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...