제출 #415105

#제출 시각아이디문제언어결과실행 시간메모리
415105victoriad선물상자 (IOI15_boxes)C++14
0 / 100
384 ms524292 KiB
#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;
}

컴파일 시 표준 에러 (stderr) 메시지

boxes.cpp: In function 'int dfs(bool, int, std::vector<int>&, int)':
boxes.cpp:33:1: warning: control reaches end of non-void function [-Wreturn-type]
   33 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...