Submission #422171

#	Time	Username	Problem	Language	Result	Execution time	Memory
422171		MarcoMeijer	Boxes with souvenirs (IOI15_boxes)	C++14	50 / 100	78 ms	4216 KiB

boxes

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

// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e9
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }

ll delivery(int n, int k, int l, int p[]) {
    ll i=0;
    
    ll ans = 0;

    if(k == 1 || k == n) {
        while(i < n) {
            ll cur = 0;
            RE(j,k) {
                if(i == n)
                    break;
                ll delta = abs(cur - p[i]);
                ans += min(delta, l-delta);
                cur = p[i++];
            }
            ans += min(cur, l-cur);
        }
    } else {
        ans = 1e18;
        
        ll cAns = 0;
        i = 0;
        while(i < n) {
            ll cur = 0;
            RE(j,k) {
                if(i == n)
                    break;
                ll delta = abs(cur - p[i]);
                cAns += min(delta, l-delta);
                cur = p[i++];
            }
            cAns += min(cur, l-cur);
        }
        ans = min(ans, cAns);

        RE(x,k) {
            i = 0;
            while(i < n) {
                ll delta;
                delta = p[(i+x  )%n]; cAns -= min(delta, l-delta);
                delta = p[(i+x+1)%n]; cAns += min(delta, l-delta);

                ll len = min<ll>(k, n - i);
                
                if(len != 1) {
                    delta = abs(p[(i+x+1    )%n] - p[(i+x    )%n]); cAns -= min(delta, l-delta);
                    delta = abs(p[(i+x+n-1+len)%n] - p[(i+x+len)%n]); cAns += min(delta, l-delta);
                }
                
                delta = p[(i+x+len+n-1)%n]; cAns -= min(delta, l-delta);
                delta = p[(i+x+len    )%n]; cAns += min(delta, l-delta);

                i += len;
            }
            ans = min(ans, cAns);
        }
    }

    return ans;
}

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