Submission #1109418

#TimeUsernameProblemLanguageResultExecution timeMemory
1109418Trisanu_DasNile (IOI24_nile)C++17
17 / 100
2063 ms7368 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long vector <ll> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E) { int N = W.size(), Q = E.size(); vector <tuple <int, int, int>> items; for (int i = 0; i < N; i++) items.push_back(make_tuple(W[i], A[i], B[i])); sort(items.begin(), items.end()); for (int i = 0; i < N; ++i) { auto [w, a, b] = items[i]; W[i] = w, A[i] = a, B[i] = b; } vector <ll> ans; for (int q = 0; q < Q; q++) { vector <ll> dp(N, 0); dp[0] = A[0]; for (int i = 1; i < N; ++i) { dp[i] = dp[i - 1] + A[i]; ll sum = 0; for (int j = i - 1; j >= 0; --j) { if (W[i] - W[j] <= E[q]) dp[i] = min(dp[i], (j == 0 ? 0 : dp[j - 1]) + B[i] + B[j] + sum); sum += A[j]; } } ans.push_back(dp[N - 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...