제출 #1285266

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1285266		AndriaBeridze	Boxes with souvenirs (IOI15_boxes)	C++20	100 / 100	782 ms	236692 KiB

boxes

#include <bits/stdc++.h>
    
using namespace std;

long long delivery(int N, int K, int L, int p[]) {
    vector<long long> l, r;
    l = r = {0};
    for (int i = 0; i < N; i++) {
        l.push_back(p[i]);
        r.push_back(L - p[i]);
    }

    sort(l.begin(), l.end()); 
    sort(r.begin(), r.end());
    for (int i = 1; i <= N; i++) {
        l[i] *= 2; if (i >= K) l[i] += l[i - K];
        r[i] *= 2; if (i >= K) r[i] += r[i - K];
    }

    // for (int x : l) cout << x << ' '; cout << endl;
    // for (int x : r) cout << x << ' '; cout << endl;
 
    long long ans = (long long) 1e18;
    for (int i = 0; i <= N; i++) {
        ans = min(ans, l[i] + r[N - i]);
        ans = min(ans, l[i] + r[max(0, N - i - K)] + (long long) L);
    }

    // cout << ans << endl;
    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