제출 #415164

#제출 시각아이디문제언어결과실행 시간메모리
415164victoriadBoxes with souvenirs (IOI15_boxes)C++14
20 / 100
2 ms204 KiB
#include "boxes.h"
#include <vector>
 
using namespace std;
 
int n;
long long int dfs(bool b,int K,int box[],long long int L,int N){
    bool a=false;
    long long int m=1e9,j=1e9;
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;
    if(x<=L/2)m=x;
    else if(j==1e9)j=x;
    n--;
    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-j);
    }
    else{
        return min(L,2*(L-j)+2*m);
    }
}
}
}
}
long long delivery(int N, int K, int L, int p[]) {
    n=N;
    long long int r=0;
    for(int i=0;i<N;i++){
        if(p[i]==0){
            p[i]=-1;
            n--;
        }
        else{
            break;
        }
    }
    while(n>0){
        bool b=true;
        r+=dfs(b,K,p,L,N);
    }
    return r;
}

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

boxes.cpp: In function 'long long int dfs(bool, int, int*, long long int, int)':
boxes.cpp:18:13: warning: conversion from 'long long int' to 'double' may change value [-Wconversion]
   18 |     else if(j==1e9)j=x;
      |             ^
boxes.cpp:34:1: warning: control reaches end of non-void function [-Wreturn-type]
   34 | }
      | ^
#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...