제출 #1309163

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1309163		avohado	선물상자 (IOI15_boxes)	C++20	0 / 100	1 ms	576 KiB

boxes

#include <bits/stdc++.h>
#include "boxes.h"
using namespace std;
#define mod 1000000007
#define maxn 200005
#define f first
#define s second
#define ll long long
#define pb(x) push_back(x)
#define mp make_pair
#define all(x) x.begin(), x.end()
#define len(v) max(0, (int)v.size())
long long delivery(int N, int k, int L, int p[]){
    vector<int> l, r;
    long long ans1=0, ans2=0;
    for(int i=0; i<N; i++){
        if(p[i]<(L+1)/2){
            l.pb(p[i]);
        }else{
            r.pb(L-p[i]);
        }
    }
    int i=0, j=0, n=len(l), m=len(r);
    while(i<n){
        int d=min(k, n-i);
        ans1+=l[i+d-1]*2;
        if(d!=k){
            ans2=ans1-l[i+d-1]*2+L;
            m=m-k+d;
        }
        i+=d;
    }
    reverse(r.begin(), r.end());
    while(j<m){
        int d=min(k, m-j);
        ans2+=r[j+d-1]*2;
        j+=d;
    }
    j=0; m=len(r);
    while(j<m){
        int d=min(k, m-j);
        ans1+=r[j+d-1]*2;
        j+=d;
    }
    return min(ans1, ans2);
}

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