# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
765753 | t6twotwo | Meetings (IOI18_meetings) | C++17 | 266 ms | 1504 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll inf = 1e18;
vector<ll> minimum_costs(vector<int> H, vector<int> L, vector<int> R) {
int N = H.size(), Q = L.size();
vector<ll> ans(Q);
for (int i = 0; i < Q; i++) {
int T = L[i];
for (int j = L[i]; j <= R[i]; j++) {
if (H[j] < H[T]) {
T = j;
}
}
int mx = H[T];
for (int j = T; j <= R[i]; j++) {
mx = max(mx, H[j]);
ans[i] += mx;
}
mx = H[T];
for (int j = T; j >= L[i]; j--) {
mx = max(mx, H[j]);
ans[i] += mx;
}
ans[i] -= H[T];
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |