Submission #740409

#TimeUsernameProblemLanguageResultExecution timeMemory
740409danikoynov모임들 (IOI18_meetings)C++14
4 / 100
5520 ms2240 KiB
#include "meetings.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; const int maxn = 7.5e5 + 10; int n, q; ll h[maxn]; ll calc(int pivot, int left, int right) { ll mx = 0, ans = 0; for (int i = pivot; i >= left; i --) { mx = max(mx, h[i]); ans += mx; } mx = h[pivot]; for (int i = pivot + 1; i <= right; i ++) { mx = max(mx, h[i]); ans += mx; } return ans; } ll query(int left, int right) { ll ans = 1e18; for (int pivot = left; pivot <= right; pivot ++) { ans = min(ans, calc(pivot, left, right)); } return ans; } vector<long long> minimum_costs(vector<int> H, vector<int> L, vector<int> R) { n = H.size(); q = L.size(); for (int i = 0; i < n; i ++) { h[i] = H[i]; } vector < ll > res(q); for (int i = 0; i < q; i ++) { res[i] = query(L[i], R[i]); } return res; }
#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...