Submission #802424

#	Time	Username	Problem	Language	Result	Execution time	Memory
802424		Boomyday	Boxes with souvenirs (IOI15_boxes)	C++14	100 / 100	497 ms	196172 KiB

boxes

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using db = double;
using str = string; // yay python!

using ii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;

using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vii = vector<ii>;
using vpl = vector<pl>;
using vpd = vector<pd>;

#define tcT template<class T
#define tcTU tcT, class U

tcT> using V = vector<T>;
tcT, size_t SZ> using AR = array<T,SZ>;
tcT> using PR = pair<T,T>;

// pairs
#define mp make_pair
#define f first
#define s second



#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define len(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pb push_back
#define eb emplace_back
#define pf push_front

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5;
const ll INF = 1e18; // not too close to LLONG_MAX
const ld PI = acos((ld)-1);
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1}; // for every grid problem!!



long long delivery(int N, int K, int L, int p[]) {
    vl left(N+1,INF),right(N+1,INF);
    left[0] = 0; right[0] = 0;

    for(int i=1;i<=K;++i){
        left[i] =  2*p[i-1];
        right[i] =  2*(L-p[N-i]);
    }
    for(int i=K+1; i<=N; ++i){

        left[i] = left[i-K] + 2*p[i-1];
        right[i] = right[i-K] + 2*(L-p[N-i]);

    }
    ll ans = INF;
    F0R(i, N+1) ans = min(ans, left[i]+right[N-i]);
    F0R(i, N+1-K) ans = min(ans, left[i]+L+right[N-K-i]);

    return ans;
}

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