# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
415118 | victoriad | Boxes with souvenirs (IOI15_boxes) | C++14 | 2 ms | 284 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;
int dfs(bool b,int K,int box[],int L,int N){
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;
n-=1;
box[i]=-1;
}
if(K==0||n==0||i==N-1){
if((x<=L/2))return 2*x;
else if(b){
return 2*(L-x);
}
else{
return L;
}
}
}
}
}
long long delivery(int N, int K, int L, int p[]) {
n=N;
long long int r=0;
int x=0;
while(n>0){
bool b=true;
r+=dfs(b,K,p,L,N);
}
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... |