Submission #1129250

#	Time	Username	Problem	Language	Result	Execution time	Memory
1129250		coolavy999	Boxes with souvenirs (IOI15_boxes)	C++20	10 / 100	0 ms	328 KiB

boxes

// Problem: https://oj.uz/problem/view/IOI15_boxes

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

using ll = long long;

ll delivery(int n, int k, int l, int pos[]) {
	sort(pos, pos + n);

	if (k == 1) { // subtask 1
		ll ans = 0;
		int mid = l >> 1;
		for (int i = 0; i < n; i++) {
			if (pos[i] <= mid) {
				ans += 1ll * 2 * pos[i];
			} else {
				ans += 1ll * 2 * (l - pos[i]);
			}
		}

		return ans;
	} else if (k == n) { // subtask 2
		return l;
	} else { // subtask 3-7
		return 47;
	}
}

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