Submission #1245088

#TimeUsernameProblemLanguageResultExecution timeMemory
1245088nibertNile (IOI24_nile)C++20
0 / 100
18 ms3396 KiB
#include <vector> #include <algorithm> using namespace std; vector<long long> calculate_costs( vector<int> W, vector<int> A, vector<int> B, vector<int> E){ long long n = A.size(); long long q = E.size(); long long cost = 0; long long min_cost = 0; vector <long long> costs(q); vector <long long> extra(n); for (int i = 0; i < n; i++){ extra[i] = A[i] - B[i]; cost += B[i]; } for (int i = 0; i < n; i++){ min_cost = min(min_cost, extra[i]); } for (int i = 0; i < q; i++){ if (n%2 == 0){ costs[i] = cost; } else{ costs[i] = cost + min_cost; } } return costs; }
#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...