oj.uz

Submission #1099032

# Submission time Handle Problem Language Result Execution time Memory
1099032 2024-10-10T12:31:16 Z noyancanturk Safety (NOI18_safety) C++17
0 / 100
 19 ms 6588 KB 
#include "bits/stdc++.h"
using namespace std;

#define int int64_t    
#define pb push_back

using pii=pair<int,int>;

const int lim=2e5+100;
const int mod=1e9+7;


signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#ifdef Local  
    freopen(".in","r",stdin);freopen(".out","w",stdout);
#endif
    int n,h;
    cin>>n>>h;
    int a[n];
    for(int i=0;i<n;i++)cin>>a[i];
    priority_queue<int>p1;
    priority_queue<int,vector<int>,greater<int>>p2;
    p1.push(INT_MIN);
    p2.push(INT_MAX);
    int ans=0;
    int shift=0;
    for(int i=0;i<n;i++){
        shift+=h;
        int leftguy=p1.top()-shift;
        int rightguy=p2.top()+shift;
        assert(leftguy<=rightguy);
        if(leftguy<=a[i]&&a[i]<=rightguy){
            p1.push(a[i]+shift);
            p2.push(a[i]-shift);
        }else if(rightguy<a[i]){
            ans+=a[i]-rightguy;
            p1.push(rightguy+shift);
            p2.push(a[i]-shift);
            p2.push(a[i]-shift);
        }else{
            ans+=leftguy-a[i];
            p2.push(leftguy-shift);
            p1.push(a[i]+shift);
            p1.push(a[i]+shift);
        }
    }
    cout<<ans;
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 452 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 1 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 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

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

Subtask #5
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 452 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 0 ms 348 KB Output is correct
2 Correct 0 ms 452 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 0 ms 348 KB Output is correct
2 Correct 0 ms 452 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 0 ms 348 KB Output is correct
2 Correct 0 ms 452 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 0 ms 348 KB Output is correct
2 Correct 0 ms 452 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -