제출 #102222

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
102222		Leonardo_Paes	선물상자 (IOI15_boxes)	C++11	0 / 100	3 ms	484 KiB

boxes

#include <bits/stdc++.h>
#include "boxes.h"
 
using namespace std;
 
typedef long long ll;
 
long long delivery(int N, int K, int L, int positions[]){
 
    long long x = N, sum=0;
 
    long long ini=0, fim=N-1;
 
    for(long long i=x; i>1; i-=2){
        if(ini+(K-1)<=N-1 and fim-(K-1)>=0 and (2ll*(positions[ini+(K-1)]))<(2ll*(L-positions[fim-(K-1)]))){
            sum+=2ll*(positions[ini+(K-1)]);
            ini+=K;
        }
        else if (2ll*(L-positions[fim-(K-1)]) < L){
            sum+=2ll*(L-positions[fim-(K-1)]);
            fim-=K;
        }
        else{
            sum+=L;
            ini+=K;
        }
    }
    if(ini>N)positions[ini]=0;
    if(fim<0)fim=0, positions[fim]=0;
    sum+=min(2ll*positions[ini], 2ll*(L-positions[fim]));
 
    return sum;
}

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