Submission #242825

#	Time	Username	Problem	Language	Result	Execution time	Memory
242825		godwind	Boxes with souvenirs (IOI15_boxes)	C++14	10 / 100	29 ms	31744 KiB

boxes

#include "boxes.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <random>
#include <set>
#include <map>
#include <queue>
#include <cstring>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <functional>

using namespace std;

template<typename T> void uin(T &a, T b) {
	if (b < a) {
		a = b;
	}
}

const int N = 1000 * 1000 + 7; // for now
const long long INF = 1e18 + 228;

long long pref[N], suff[N];

priority_queue<long long> Q[N];
long long mod[N];

long long delivery(int n, int k, int L, int p[]) {
	for (int i = 1; i <= n; ++i) {
		pref[i] = 2LL * p[i - 1];
		if (i > k) {
			pref[i] += pref[i - k];
		}
	}
	for (int i = n; i; --i) {
		suff[i] = 2LL * (L - p[i - 1]);
		if (i + k <= n) {
			suff[i] += suff[i + k];
		}
	}
	/*for (int i = 1; i <= n; ++i) {
		cout << pref[i] << ' ';
	}
	cout << endl;
	for (int i = 1; i <= n; ++i) {
		cout << suff[i] << ' ';
	}
	cout << '\n';*/
	long long answer = min(suff[1], pref[n]);
	int rem = 0;
	for (int r = 1; r <= n + 1; ++r) {
		mod[rem] += L;
		Q[rem].push(-(pref[r - 1] - mod[rem]));
		uin(answer, suff[r] + (-Q[rem].top() + mod[rem] ));
		++rem;
		if (rem == k) --rem;
	}
	/*for (int c = 0; c <= (n + k - 1) / k; ++c) {
		long long cur = (long long)L * (long long)c;
		long long addit = INF;
		for (int l = 1; l <= n - c * k + 1; ++l) {
			uin(addit, pref[l - 1] + suff[l + c * k]);
		}
		uin(answer, cur + addit);
	}*/
    return answer;
}

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