제출 #593658

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
593658		davi_bart	선물상자 (IOI15_boxes)	C++17	10 / 100	4 ms	340 KiB

boxes

#pragma GCC optimize("O3")
#include <bits/stdc++.h>

#include "boxes.h"
#define ll long long
#define fi first
#define se second
#define pb push_back
#define int ll
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<int> v;
int N, K, L;
int dist(int a, int b) {
    if (a > b) swap(a, b);
    return min(b - a, a + L - b);
}
long long delivery(signed n, signed k, signed l, signed p[]) {
    N = n;
    K = k;
    L = l;
    for (int i = 0; i < N; i++) v.pb(p[i]);
    vector<int> ans;
    for (int i = 0; i <= N; i++) {
        int tot = 0;
        for (int j = i - 1; j >= 0; j -= K) {
            tot += dist(0, v[j]);
            for (int h = j - 1; h >= max((int)0, j - K); h--) {
                tot += dist(v[h + 1], v[h]);
            }
            int o = v[0];
            if (j - K + 1 >= 0) o = v[j - K + 1];
            tot += dist(0, o);
        }
        ans.pb(tot);
        // cout << tot << " ";
    }
    // cout << endl;
    reverse(v.begin(), v.end());
    vector<int> ans1;
    for (int i = 0; i <= N; i++) {
        int tot = 0;
        for (int j = i - 1; j >= 0; j -= K) {
            tot += dist(0, v[j]);
            for (int h = j - 1; h >= max((int)0, j - K); h--) {
                tot += dist(v[h + 1], v[h]);
            }
            int o = v[0];
            if (j - K + 1 >= 0) o = v[j - K + 1];
            tot += dist(0, o);
        }
        ans1.pb(tot);
        // cout << tot << " ";
    }
    // cout << endl;
    int mi = 1e18;
    for (int i = 0; i <= N; i++) {
        // cout << ans[i] << " " << ans1[N - i] << endl;
        mi = min(mi, ans[i] + ans1[N - i]);
    }
    return mi;
}

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