oj.uz

Submission #1000635

# Submission time Handle Problem Language Result Execution time Memory
1000635 2024-06-18T05:06:19 Z vjudge1 Safety (NOI18_safety) C++17
0 / 100
 67 ms 14932 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int  N = 3e5 + 30, MOD = 1e9 + 7;

int n,h;
ll a[N];
multiset<ll> l,r;
ll addl = 0,addr = 0;
void test(){
    cin >> n >> h;
    for(int i = 1;i <= n;i++){
        cin >> a[i];
    }
    l.insert(a[1]);
    r.insert(a[1]);
    ll H = 0;
    for(int i = 1;i <= n;i++){
        ll L = (*l.rbegin()) + addl,R = (*r.begin()) + addr;
        if(a[i] >= L && a[i] <= R){
            l.insert(a[i] - addl);
            r.insert(a[i] - addr);
        }else if(a[i] >R){
            H += (a[i] - R);
            r.erase(r.find(R - addr));
            l.insert(R - addl);
            r.insert(a[i] - addr);r.insert(a[i] - addr);
        }else{
            H  += (L - a[i]);
            l.erase(l.find(L - addl));
            r.insert(L - addr);
            l.insert(a[i] - addl);
            l.insert(a[i] - addl);
        }
        addl -= h;
        addr += h;
    }
    assert(*r.begin()+addr >= 0);
    cout << H << '\n';
}
int main() {
    ios_base::sync_with_stdio(false);cin.tie(0);
    int t = 1;
    // cin >> t;
    while(t--){
        test();
    }
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 1 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 67 ms 14932 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #9
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -