Submission #1317263

#TimeUsernameProblemLanguageResultExecution timeMemory
1317263foxsergNile (IOI24_nile)C++20
6 / 100
17 ms2596 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; vector <ll> calculate_costs(vector <int> W, vector <int> A, vector <int> B, vector <int> E) { int n = A.size(); ll sm = 0; ll c = 1e9; for (int i = 0; i < n; ++i) { sm += B[i]; c = min(c, (ll)A[i] - B[i]); } vector <ll> ans(E.size()); for (int i = 0; i < E.size(); ++i) { if (n & 1) { ans[i] = sm + c; } else { ans[i] = sm; } } 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...