Submission #868442

# Submission time Handle Problem Language Result Execution time Memory
868442 2023-10-31T13:35:17 Z Warinchai Safety (NOI18_safety) C++14
4 / 100
54 ms 3348 KB
#include<bits/stdc++.h>
using namespace std;
priority_queue<int>pql;
priority_queue<int,vector<int>,greater<int> >pqr;
int lzl,lzr;
int ans=0;
int main(){
    int n,h;
    cin>>n>>h;
    for(int i=0;i<n;i++){
        int a;
        cin>>a;
        if(i>0&&a<pql.top()+lzl){
            //cout<<"left\n";
            pql.push(a-lzl);
            pql.push(a-lzl);
            ans+=abs(a-pql.top()-lzl);
            pqr.push(pql.top()+lzl-lzr);
            pql.pop();
        }else if(i>0&&a>pqr.top()+lzr){
            //cout<<"right\n";
            pqr.push(a-lzr);
            pqr.push(a-lzr);
            ans+=abs(a-pqr.top()-lzr);
            pql.push(pqr.top()+lzr-lzl);
            pqr.pop();
        }else{
            //cout<<"middle\n";
            pql.push(a-lzl);
            pqr.push(a-lzr);
        }
        lzl-=h;
        lzr+=h;
        //cout<<ans<<" ";
    }
    cout<<ans;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 436 KB Output isn't correct
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 436 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 54 ms 3348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 436 KB Output isn't correct
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 436 KB Output isn't correct
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 436 KB Output isn't correct
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 436 KB Output isn't correct
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 436 KB Output isn't correct
5 Halted 0 ms 0 KB -