| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 869512 | kim | Safety (NOI18_safety) | C++17 | 42 ms | 5488 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
using ll=long long;
#define pb push_back
int32_t main(){
ios::sync_with_stdio(false); cin.tie(0);
int n; cin>>n;
ll k; cin>>k;
priority_queue<ll> pql;
priority_queue<ll,vector<ll>,greater<ll>> pqr;
ll x; cin>>x;
pql.push(x),pqr.push(x);
ll ans=0;
for(int i=1;i<n;++i){
cin>>x;
ll y=i*k;
if(x<pql.top()-y){
ans+=abs(pql.top()-y-x);
pql.push(x+y);
pql.push(x+y);
pqr.push(pql.top()-y-y);
pql.pop();
}
else if(x>pqr.top()+y){
ans+=abs(pqr.top()+y-x);
pqr.push(x-y);
pqr.push(x-y);
pql.push(pqr.top()+y+y);
pqr.pop();
}
else{
pql.push(x+y);
pqr.push(x-y);
}
}
cout<<ans<<endl;
return 0;
}
/*
6 7
1 2
2 3
3 1
2 4
4 5
5 6
6 5
*/| # | 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... | ||||
