Submission #1159073

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1159073	2025-02-28 06:47:41	egregious	Safety (NOI18_safety)	C++20	100 / 100	150 ms	18972 KiB

safety

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
// https://oj.uz/problem/view/NOI18_safety
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
    int n; ll k, dl = 0, dr = 0, mn = 0;
    cin >> n >> k;
    // {l} + dl and {r} + dr store points at which slope changes
    multiset<ll> l, r;
    for (int i = 0; i < n; i++) {
        ll s; cin >> s;
        if (l.size() && s < *l.rbegin() + dl) {
            l.insert({s - dl, s - dl}); // insert value twice
            r.insert(*l.rbegin() + dl - dr);
            mn += *l.rbegin() + dl - s;
            l.erase(--l.end());
        }
        else if (r.size() && s > *r.begin() + dr) {
            r.insert({s - dr, s - dr}); // insert value twice
            l.insert(*r.begin() + dr - dl);
            mn += s - *r.begin() - dr;
            r.erase(r.begin());
        }
        else l.insert(s - dl), r.insert(s - dr);
        dl -= k, dr += k;
    }
    cout << mn << endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 3 / 3
• Subtask 2: 4 / 4
• Subtask 3: 9 / 9
• Subtask 4: 5 / 5
• Subtask 5: 6 / 6
• Subtask 6: 11 / 11
• Subtask 7: 11 / 11
• Subtask 8: 22 / 22
• Subtask 9: 29 / 29