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