# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
65246 | KHUSRAV | 선물상자 (IOI15_boxes) | C++14 | 2 ms | 420 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "boxes.h"
#include<bits/stdc++.h>
using namespace std ;
long long delivery(int N, int K, int L, int p[]) {
deque<int> dq ;
long long ans = 0 ;
for(int i = 0 ; i < N ; i++)
dq.push_back(p[i]);
int pp ;
while(dq.size() > 0){
if(dq.size() >= K){
int v1 = dq[K - 1];
v1 += min(v1 , L - dq[K - 1] );
int v2 = L - dq[dq.size() - K] ;
v2 += min(v2 , dq[dq.size() - K]);
//cout << v1 <<" "<<v2<<'\n';
if(v1 <= v2){
ans += v1 ;
pp = K ;
while(pp > 0){
pp -- ;
dq.pop_front();
}
}
else{
ans += v2 ;
pp = K ;
while(pp > 0){
pp -- ;
dq.pop_back();
}
}
}
else{
K = dq.size();
int v1 = dq[K - 1];
v1 += min(v1 , L - dq[K - 1] );
int v2 = L - dq[dq.size() - K] ;
v2 += min(v2 , dq[dq.size() - K]);
if(v1 <= v2){
ans += v1 ;
pp = K ;
while(pp > 0){
pp -- ;
dq.pop_front();
}
}
else{
ans += v2 ;
pp = K ;
while(pp > 0){
pp -- ;
dq.pop_back();
}
}
}
}
return ans ;
}
Compilation message (stderr)
# | 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... |