제출 #1073235

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1073235		Icelast	선물상자 (IOI15_boxes)	C++17	100 / 100	689 ms	383556 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll maxn = 2*1e5+5, INF = 4e18+9;
ll solve(int n, int k, int B, ll L, vector<int> a){
    vector<ll> b, c;
    b.push_back(0);
    c.push_back(0);
    for(int i = 1; i <= n; i++){
        if(a[i] <= B){
            b.push_back(a[i]);
        }
    }
    for(int i = n; i >= 1; i--){
        if(a[i] > B){
            c.push_back(L-a[i]);
        }
    }
    vector<vector<ll>> sum(2, vector<ll>(k+1, 0)), pf(2, vector<ll>(k+1, 0));
    for(int i = 1; i < (int)b.size(); i++){
        sum[0][i%k] += b[i]*2;
    }
    for(int i = 1; i < (int)c.size(); i++){
        sum[1][i%k] += c[i]*2;
    }
    ll ans = INF;

    int bb = ((int)b.size()-1)%k, cc = ((int)c.size()-1)%k;
    for(int i = 0; i < k; i++){
        int j = (k+cc-(2*k-(bb - i + k))%k)%k;
        ans = min(ans, sum[0][i] +  sum[1][j] + L);
    }
    ans = min(ans, sum[0][bb]+sum[1][cc]);
    if((int)b.size()-1 < k){
        int j = (cc-(k-bb)+k)%k;
        ans = min(ans, L+sum[1][j]);
    }
    if((int)c.size()-1 < k){
        int j = (bb-(k-cc)+k)%k;
        ans = min(ans, L+sum[0][j]);
    }
    return ans;
}
long long delivery(int N, int K, int L, int p[]) {
    int n = N, k = K;
    vector<int> a(n+1);
    for(int i = 1; i <= n; i++){
        a[i] = p[i-1];
    }
    ll ans = INF;
    if(L%2==0){
        ans = min(ans, solve(n, k, L/2, L, a));
        ans = min(ans, solve(n, k, L/2-1, L, a));
    }else{
        ans = min(ans, solve(n, k, L/2, L, a));
    }
    return ans;
}

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