Submission #57895

#	Time	Username	Problem	Language	Result	Execution time	Memory
57895		E869120	Boxes with souvenirs (IOI15_boxes)	C++14	10 / 100	2 ms	380 KiB

boxes

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

long long delivery(int N, int K, int L, int pos[]) {
	long long minx = (1LL << 60);

	for (int i = 0; i <= K; i++) {
		vector<pair<int, int>>vec;
		int cx = i;
		while (cx < i + N) {
			vec.push_back(make_pair(cx, min(i + N - 1, cx + K - 1)));
			cx += K;
		}
		long long sum = 0;
		for (int j = 0; j < vec.size(); j++) {
			long long V1 = pos[vec[j].first % N], V2 = pos[vec[j].second % N];
			long long ret = min(V2, L - V1);

			if (vec[j].first < N && vec[j].second >= N) {
				sum += max(V1, L - V1) + max(V2, L - V2);
			}
			else {
				sum += ret;
			}
		}
		minx = min(minx, sum);
	}

	return minx * 2;
}

Compilation message (stderr)

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:17:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < vec.size(); j++) {
                   ~~^~~~~~~~~~~~

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