Submission #1218479

#	Time	Username	Problem	Language	Result	Execution time	Memory
1218479		LIA	선물상자 (IOI15_boxes)	C++17	20 / 100	0 ms	328 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef tuple <ll,ll,ll> plll;
typedef vector <plll> vplll;
typedef pair <ll,ll> pll;
typedef vector <ll> vll;
typedef vector <pll> vpll;
typedef vector <vector <pll>> vvpll;
typedef vector <vector <ll>> vvll;
typedef vector <bool> vb;
typedef vector <vector <bool>> vvb;
#define loop(i, s, e) for (ll i = (s); i < (e); ++i)
#define loopr(i, e, s) for (ll i = (e)-1; i >= (s); --i)
#define all(a) a.begin(), a.end()
const ll inf = 1e18;
ll n,k,l;
vll p;
vll r;
long long delivery(int N, int K, int L, int P[]) {
    n=N,k=K,l=L;
    p.resize(n);
    r.resize(n);
    loop(i,0,n) {
        p[i] = P[i];
        r[i] = l-p[i];
    }
    sort(all(p));
    sort(all(r));
    vll suml(n), sumr(n);
    {
        ll in  = 0, last = 0, sumk = 0;
        loop(i,0,n) {
            in++;
            ll loc =  p[i];
            if (in%k == 0) {// סגירת מעגלs
                suml[i] = last + loc + min(l-loc, loc);
                last = suml[i];
            }
            else {
                suml[i] = last +  loc +min(l-loc, loc);
            }
        }
    }

    {
            ll in  = 0, last = 0, sumk = 0;
            loop(i,0,n) {
                in++;
                ll loc =  r[i];
                if (in%k == 0) {
                    sumr[i] = last + loc + min(loc, l-loc);
                    last = sumr[i];
                }
                else {
                    sumr[i] = last + loc + min(loc, l-loc);
                }
            }
        }

    ll ans = inf;
    reverse(all(sumr));
    suml.push_back(0);
    sumr.push_back(0);
    loop(i,0,n) {
        ans = min(ans,suml[i] + sumr[(i+1)]);
    }
    ans = min(ans, sumr[0]);
    return ans;
}

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