oj.uz

Submission #968602

# Submission time Handle Problem Language Result Execution time Memory
968602 2024-04-23T17:03:58 Z alex_2008 Boxes with souvenirs (IOI15_boxes) C++14
35 / 100
 1 ms 500 KB 
#include "boxes.h"
#include <iostream>
#include <vector>
#include <algorithm>
typedef long long ll;
using namespace std;
ll delivery(int n, int k, int l, int pos[]) {
	vector <int> a, b;
	vector <ll> dp_a, dp_b;
	for (int i = 0; i < n; i++) {
		if (pos[i] <= (l / 2)) a.push_back(pos[i]);
		else b.push_back(pos[i]);
	}
	reverse(b.begin(), b.end());
	for (auto &it : b) {
		it = l - it;
	}
	dp_a.resize((int)a.size());
	dp_b.resize((int)b.size());
	for (int i = 0; i < (int)dp_a.size(); i++) {
		if (i < k) {
			dp_a[i] = 2 * a[i];
		}
		else {
			dp_a[i] = dp_a[i - k] + 2 * a[i];
		}
	}
	for (int i = 0; i < (int)dp_b.size(); i++) {
		if (i < k) {
			dp_b[i] = 2 * b[i];
		}
		else {
			dp_b[i] = dp_b[i - k] + 2 * b[i];
		}
	}
	int ind1 = 0, ind2 = 0;
	ll ans = l * 1ll * ((n + k - 1) / k);
	ll cur = 0;
	for (int i = 1; i <= n; i++) {
		if (ind1 == (int)dp_a.size()) {
			if (ind2) cur -= dp_b[ind2 - 1];
			cur += dp_b[ind2];
			ind2++;
		}
		else if (ind2 == (int)dp_b.size()) {
			if (ind1) cur -= dp_a[ind1 - 1];
			cur += dp_a[ind1];
			ind1++;
		}
		else {
			ll diff1 = dp_a[ind1];
			if (ind1) diff1 -= dp_a[ind1 - 1];
			ll diff2 = dp_b[ind2];
			if (ind2) diff2 -= dp_b[ind2 - 1];
			if (diff1 <= diff2) {
				cur += diff1;
				ind1++;
			}
			else {
				cur += diff2;
				ind2++;
			}
		}
		ans = min(ans, ((n - i + k - 1) / k * 1ll * l) + cur);
	}
	return ans;
}
/*
int main() {
	int n, k, l;
	cin >> n >> k >> l;
	vector <int> v(n);
	for (auto &it : v) {
		cin >> it;
	}
	cout << delivery(n, k, l, v) << "\n";
}*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 436 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 432 KB Output is correct
4 Correct 0 ms 500 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 436 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 432 KB Output is correct
18 Correct 0 ms 500 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Incorrect 0 ms 344 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 436 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 432 KB Output is correct
18 Correct 0 ms 500 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Incorrect 0 ms 344 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 436 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 432 KB Output is correct
18 Correct 0 ms 500 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Incorrect 0 ms 344 KB Output isn't correct
28 Halted 0 ms 0 KB -