제출 #434154

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

boxes

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
#pragma GCC optimize ("O3")
#pragma GCC optimize ("O2")
#define F first
#define S second
//#define endl '\n'
//#define int long long

using namespace std;

ll delivery(int N, int K, int L, int p[])
{
    if (K == 1)
    {
        ll ans = 0;
        for(int i = 0; i < N; i++) ans += 2 * min(p[i], L - p[i]);
        return ans;
    }

    sort(p, p + N);

    ll ans = L;
    for(int i = N - K - 1; i >= 0; i -= K)
    {
        ans += 2 * p[i];
    }

    return ans;

    //for(int i = 0, curFuel = K; i < N; i++)
    //{

    //}
    /*
    sort(p, p + N);

    ll dp[N][K + 1];
    dp[0][K] = 2ll * min(p[0], L - p[0]);

    for(int i = K - 1; i >= 0; i--)
        dp[0][i] = min(p[0], L - p[0]);

    for(int i = 1; i < N; i++)
    {
        ll tmp1 = abs(p[i] - p[i - 1]);
        ll tmp2 = tmp1;//L - abs(p[i] - p[i - 1]);
        ll dist = min(tmp1, tmp2);

        dp[i][K] = dp[i - 1][1] + dist + min(p[i], L - p[i]);
        dp[i][K - 1] = dp[i - 1][K] + min(p[i], L - p[i]);

        for(int j = K - 2; j >= 0; j--)
            dp[i][j] = dp[i - 1][j + 1] + dist;
    }

    ll mn = LLONG_MAX;
    for(int i = 0; i <= K; i++) mn = min(mn, dp[N - 1][i]);

    //cout << endl;
    mn += min(p[N - 1], L - p[N - 1]);


    cout << mn << endl;
    for(int i = K; i >= 0; i--)
    {
        for(int j = 0; j < N; j++) cout << dp[j][i] << " ";
        cout << endl;
    }
    cout << endl;


    //for(int x : order) cout << p[x] << " ";
    //cout << endl;
    for(int i = K; i >= 0; i--)
    {
        //for(int j = 0; j < N; j++) cout << dp[j][i] << " ";
        //cout << endl;
    }
        //cout << endl;
    return mn;
    */
}

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