제출 #415125

#제출 시각아이디문제언어결과실행 시간메모리
415125victoriadBoxes with souvenirs (IOI15_boxes)C++14
10 / 100
2 ms256 KiB
#include "boxes.h"
#include <vector>

using namespace std;

int n;
int dfs(bool b,int K,int box[],int L,int N){
    bool a=false;
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;
    n-=1;
    box[i]=-1;
    }
if(K==0||n==0||i==N-1){
    if((x<=L/2))return 2*x;
    else if(b){
        if(a)return 2*(L/2);
        else 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;
}

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:35:9: warning: unused variable 'x' [-Wunused-variable]
   35 |     int x=0;
      |         ^
boxes.cpp: In function 'int dfs(bool, int, int*, int, int)':
boxes.cpp:31:1: warning: control reaches end of non-void function [-Wreturn-type]
   31 | }
      | ^
#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...