# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
415237 | victoriad | Boxes with souvenirs (IOI15_boxes) | C++14 | 1 ms | 204 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 <vector>
using namespace std;
int n;
long long int dfs(bool b,int K,int box[],long long int L,int N,int tk){
bool a=false;
long long int m=1e12,j=1e12;
for(int i=0;i<N;i++){
if(box[i]!=-1){
int x=box[i];
if(1<=K){
K-=1;
if(x<=L/2)b=false;
if(x==L/2)a=true;
if(x<=L/2)m=x;
else if(j==1e12){
j=x;
if(2*m+2*(L-j)<=L){
if(tk>=N-i){
n=0;
return 2*m+2*(L-j);
}
else
return 2*m;
}
else if(tk>=2 && i+K<N){
if(2*m+2*(L-j)<2*L-box[i+K]){
return 2*m;
}
}
}
n--;
box[i]=-1;
}
if(K==0||n==0||i==N-1){
if((x<=L/2))return 2*x;
else if(b){
return 2*(L-j);
}
else{
return min(L,2*(L-j)+2*m);
}
}
}
}
}
long long delivery(int N, int K, int L, int p[]) {
n=N;
long long int r=0;
for(int i=0;i<N;i++){
if(p[i]==0){
p[i]=-1;
n--;
}
else{
break;
}
}
while(n>0){
bool b=true;
r+=dfs(b,K,p,L,N,K);
}
return r;
}
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... |