제출 #249374

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
249374		ryansee	선물상자 (IOI15_boxes)	C++14	100 / 100	717 ms	62892 KiB

boxes

#include "boxes.h"

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

#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }

using ll=long long; 
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 

#define LLINF ((long long)1e18)
#define INF int(1e9+1e6)
#define MAXN (300006)

long long delivery(int n, int k, int l, int p[]) {
	vector<ll> sum(k,0);
	vector<ll> bck(k,0);
	FOR(i,0,n-1)bck[(n-i)%k]+=(l-p[i])*2;
	ll mi=bck[n%k];
	FOR(i,0,n-1){
		bck[(n-i)%k] -= (l-p[i])*2;
		mi=min(mi,sum[(i+1)%k]+min(l,p[i]*2)+bck[(n-i-1)%k]);
		sum[(i+1)%k] += p[i]*2;
	}
	return mi;
}

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