제출 #415596

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
415596		victoriad	선물상자 (IOI15_boxes)	C++14	35 / 100	2 ms	284 KiB

boxes

#include "boxes.h"
#include <vector>
 
using namespace std;
 
int n,n2;
long long int dfs(bool b,int K,int box[],long long int L,int N,int tk){
    long long int m=1e12,j=1e12;
for(int i=0;i<N;i++){
    if(box[i]!=-1){
    int x=box[i];
    if(1<=K){
    K--;
    if(x<=L/2)b=false;
    if(x<=L/2)m=x;
    else if(j==1e12){
        j=x;
        if(2*m+2*(L-j)<=L){
            return 2*m;
        }
    }
     n--;
    box[i]=-1;
    }
    if(K==0||n==0){
    if((x<=L/2))return 2*x;
    else if(b){
         return 2*(L-j);
    }
    else{
        return min(L,2*(L-j)+2*m);
    }
    }   
    }
    }
}


long long int dfs2(bool b,int K,int box2[],long long int L,int N,int tk){
    long long int j=1e12,m=1e12;
for(int i=N-1;i>=0;i--){
    if(box2[i]!=-1){
        int x=box2[i];
        if(K>=1){
            K--;
            if(x>L/2){
                b=false;
                j=x;
            }
            else if(m==1e12){
                m=x;
            }
            n2--;
            box2[i]=-1;
        }
        if(K==0||n2==0){
            if(x>L/2)return 2*(L-x);
            else if(b){
                return 2*m;
            }
            else{
                return min(L,2*m+2*(L-j));
            }
        }
    }
}
}

long long delivery(int N, int K, int L, int p[]) {
    n=N;
    n2=N;
    int p2[N];
    for(int i=0;i<N;i++)p2[i]=p[i];
    long long int r=0;
    long long int r2=0;
    while(n>0){
        bool b=true;
        r+=dfs(b,K,p,L,N,K);
    }
    while(n2>0){
        bool b=true;
        r2+=dfs2(b,K,p2,L,N,K);
    }
    return min(r,r2);
}

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

boxes.cpp: In function 'long long int dfs(bool, int, int*, long long int, int, int)':
boxes.cpp:16:13: warning: conversion from 'long long int' to 'double' may change value [-Wconversion]
   16 |     else if(j==1e12){
      |             ^
boxes.cpp:7:68: warning: unused parameter 'tk' [-Wunused-parameter]
    7 | long long int dfs(bool b,int K,int box[],long long int L,int N,int tk){
      |                                                                ~~~~^~
boxes.cpp: In function 'long long int dfs2(bool, int, int*, long long int, int, int)':
boxes.cpp:50:21: warning: conversion from 'long long int' to 'double' may change value [-Wconversion]
   50 |             else if(m==1e12){
      |                     ^
boxes.cpp:39:70: warning: unused parameter 'tk' [-Wunused-parameter]
   39 | long long int dfs2(bool b,int K,int box2[],long long int L,int N,int tk){
      |                                                                  ~~~~^~
boxes.cpp: In function 'long long int dfs(bool, int, int*, long long int, int, int)':
boxes.cpp:36:1: warning: control reaches end of non-void function [-Wreturn-type]
   36 | }
      | ^
boxes.cpp: In function 'long long int dfs2(bool, int, int*, long long int, int, int)':
boxes.cpp:67:1: warning: control reaches end of non-void function [-Wreturn-type]
   67 | }
      | ^

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