Submission #1039030

#	Time	Username	Problem	Language	Result	Execution time	Memory
1039030		c2zi6	Boxes with souvenirs (IOI15_boxes)	C++14	50 / 100	2033 ms	24256 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"

namespace TEST123 {
    ll delivery(int N_ARG, int K_ARG, int L_ARG, int POS_ARG[]) {
        int n = N_ARG;
        int k = K_ARG;
        ll 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;
        }
        if (k == n) {
            pos.pb(0);
            pos.pb(l);
            n += 2;
            sort(all(pos));
            ll ans = l;
            rep(i, n-1) {
                setmin(ans, 2*pos[i]+2*(l-pos[i+1]));
            }
            return ans;
        }
        VL dp(1<<n, 1e18);
        dp[0] = 0;
        replr(s, 1, (1<<n)-1) {
            rep(t, (1<<n)) if ((s | t) == s && __builtin_popcount(s ^ t) <= k) {
                VI tmp;
                tmp.pb(0);
                rep(i, n) if ((s^t)&(1<<i)) tmp.pb(pos[i]);
                tmp.pb(l);
                ll cost = l;
                rep(i, tmp.size()-1) setmin(cost, 2*tmp[i]+2*(l-tmp[i+1]));
                setmin(dp[s], dp[t] + cost);
            }
        }
        return dp[(1<<n)-1];
    }
};

int n, k;
ll l;

ll delivery(int N_ARG, int K_ARG, int L_ARG, int POS_ARG[]) {
    /*ll realanswer = TEST123::delivery(N_ARG, K_ARG, L_ARG, POS_ARG);*/

    n = N_ARG;
    k = K_ARG;
    l = L_ARG;
    VL pos;
    pos.pb(0);
    rep(i, n) pos.pb(POS_ARG[i]);
    pos.pb(l);
    n += 2;

    /*return realanswer;*/

    ll ans = 1e18;
    replr(i, 0, n-1) replr(j, i+1, n-1) {
        /*if (pos[j] - pos[i] >= (l+1)/2) {*/
        ll cur = (j-i-1 + k-1) / k * l;
        for (int c = i; c >= 0; c -= k) {
            cur += 2*pos[c];
        }
        for (int c = j; c < n; c += k) {
            cur += 2*(l-pos[c]);
        }
        setmin(ans, cur);
    }

    return ans;
}

Compilation message (stderr)

boxes.cpp: In function 'll TEST123::delivery(int, int, int, int*)':
boxes.cpp:63:58: warning: conversion from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'std::vector<int>::value_type' {aka 'int'} may change value [-Wconversion]
   63 |                 rep(i, n) if ((s^t)&(1<<i)) tmp.pb(pos[i]);
      |                                                          ^
boxes.cpp:64:24: warning: conversion from 'll' {aka 'long long int'} to 'std::vector<int>::value_type' {aka 'int'} may change value [-Wconversion]
   64 |                 tmp.pb(l);
      |                        ^

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