Submission #1038894

#	Time	Username	Problem	Language	Result	Execution time	Memory
1038894		c2zi6	Boxes with souvenirs (IOI15_boxes)	C++14	10 / 100	1 ms	432 KiB

boxes

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<typename T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "boxes.h"

int n, k;
ll l;

ll delivery(int N_ARG, int K_ARG, int L_ARG, int POS_ARG[]) {
    n = N_ARG;
    k = K_ARG;
    l = L_ARG;
    VL pos(n);
    rep(i, n) pos[i] = POS_ARG[i];

    if (k == 1) {
        ll ans = 0;
        for (ll x : pos) ans += min(x, l-x)*2;
        return ans;
    } else if (k == n) {
        ll ans = l;
        rep(i, n-1) {
            setmin(ans, 2*pos[i]+2*(l-pos[i+1]));
        }
        return ans;
    }
    assert(false);

    return 0;
}

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