# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
200379 | wilwxk | Safety (NOI18_safety) | C++14 | 59 ms | 2876 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, x;
priority_queue<int> l;
priority_queue<int, vector<int>, greater<int> > r;
int llz, rlz;
ll ans;
int main() {
scanf("%d %d", &n, &x);
for(int i = 1; i <= n; i++) {
int val; scanf("%d", &val);
if(i == 1) {
l.push(val);
r.push(val);
continue;
}
llz -= x;
rlz += x;
if(val <= l.top()+llz) {
l.push(val-llz);
l.push(val-llz);
r.push(l.top()+llz-rlz);
l.pop();
}
else {
r.push(val-rlz);
r.push(val-rlz);
l.push(r.top()+rlz-llz);
r.pop();
}
ans += r.top()+rlz-l.top()-llz;
// printf("%d >> %d %d >> %d %d >> %lld\n", i, l.top(), r.top(), llz, rlz, ans);
}
printf("%lld\n", 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... |
# | 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... |