Submission #1149693

#	Time	Username	Problem	Language	Result	Execution time	Memory
1149693		Lib	Boxes with souvenirs (IOI15_boxes)	C++20	100 / 100	363 ms	157104 KiB

boxes

#include <bits/stdc++.h>
#include "boxes.h"
 //stolen from steveonalex for reasons
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }
 
const ll INF = 1e18;
 
ll delivery(int n, int k, int L, int p[]) {
    vector<int> a;
    for(int i = 0; i<n; ++i) a.push_back(p[i]);
 
    ll ans = INF;
    vector<ll> cost(n);
    for(int i = 0; i<=n-k; ++i){
        cost[i] = min({a[i + k - 1] * 2, L, (L - a[i]) * 2});
    }
    for(int i = n-k-1; i>=0; --i) cost[i] += cost[i + k]; 
    for(int l = -1; l < k; ++l){
        int r = n;
        ll cur = 0;
        if (l >= 0) cur += a[l] * 2;
        if (r < n) cur += (L - a[r]) * 2;
        int i = l + 1, j = i + (r - i) / k * k;
        cur += cost[i];
        if (j <= n - k) cur -= cost[j];
        if (j < r){
            cur += min({a[r-1] * 2, L, (L - a[j]) * 2});
        }
        minimize(ans, cur);
    }
    return ans;
}
 
 
// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
 
//     return 0;
// }

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