Submission #1158556

#TimeUsernameProblemLanguageResultExecution timeMemory
1158556SulAMeetings (IOI18_meetings)C++20
4 / 100
5594 ms1608 KiB
#include <bits/stdc++.h> #define all(a) a.begin(), a.end() #define popcount __builtin_popcount using namespace std; vector<long long> minimum_costs(vector<int> H, vector<int> l, vector<int> r) { int n = H.size(), q = l.size(); vector<long long> ans(q); for (int i = 0; i < q; i++) { ans[i] = 1e18; for (int x = l[i]; x <= r[i]; x++) { long long cur = 0; int mx = 0; for (int y = x; y >= l[i]; y--) { mx = max(mx, H[y]); cur += mx; } mx = H[x]; for (int y = x+1; y <= r[i]; y++) { mx = max(mx, H[y]); cur += mx; } ans[i] = min(ans[i], cur); } } 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...