Submission #415111

#	Time	Username	Problem	Language	Result	Execution time	Memory
415111		victoriad	선물상자 (IOI15_boxes)	C++14	0 / 100	241 ms	524292 KiB

boxes

#include "boxes.h"
#include <vector>

using namespace std;

int n;
int dfs(bool b,int K,int box[],int L,int N,int&x){
for(int i=x;i<N;i++){
if(1<=K){
    K-=1;
    if(box[i]<=L/2)b=false;
    n-=1;

}
if(K==0||n==0||box[i]==L-1){
    x=i+1;
    if((box[i]<=L/2))return 2*box[i];
    else if(b){
        return 2*(L-box[i]);
    }
    else{
        return L;
    }
}
}
}
long long delivery(int N, int K, int L, int p[]) {
    vector<int>box(L,0);
    n=N;
    long long int r=0;
    int x=0;
    while(n>0){
        bool b=true;
        r+=dfs(b,K,p,L,N,x);
    }
    return r;
}

Compilation message (stderr)

boxes.cpp: In function 'int dfs(bool, int, int*, int, int, int&)':
boxes.cpp:26:1: warning: control reaches end of non-void function [-Wreturn-type]
   26 | }
      | ^

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30