Submission #1215232

#TimeUsernameProblemLanguageResultExecution timeMemory
1215232CauchicoNile (IOI24_nile)C++20
0 / 100
20 ms3400 KiB
#include "nile.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; ll INF = (int)5e18; vector<ll> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E) { int Q = (int)E.size(); int n = (int)W.size(); vector<ll> R(Q, 0); for (int t=0; t<Q;t++) { int D = E[t]; vector<ll> dp(n); dp[0] = A[0]; for (int i=1;i<n;i++) { dp[i] = dp[i-1] + A[i]; if (i > 1 and abs(W[i]-W[i-1]) <= D) dp[i] = min(dp[i], dp[i-2] + B[i-1] + B[i-2]); if (i > 2 and abs(W[i]-W[i-2]) <= D) dp[i] = min(dp[i], dp[i-3] + B[i-2] + A[i-1] + B[i]); } R[t] = dp.back(); } return R; }
#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...