Submission #296121

#TimeUsernameProblemLanguageResultExecution timeMemory
296121Autoratch모임들 (IOI18_meetings)C++14
4 / 100
5548 ms1660 KiB
#include "meetings.h" #include <bits/stdc++.h> using namespace std; vector<long long> minimum_costs(vector<int> H,vector<int> L,vector<int> R) { int Q = L.size(); vector<long long> C(Q); for(int j = 0; j < Q; ++j) { int l = L[j],r = R[j]; long long ans = LLONG_MAX; for(int i = l;i <= r;i++) { int each = 0; long long now = 0; for(int k = i;k >= l;k--) each = max(each,H[k]),now+=each; each = 0; for(int k = i;k <= r;k++) each = max(each,H[k]),now+=each; now-=H[i]; ans = min(ans,now); } C[j] = ans; } return C; }
#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...