oj.uz

Submission #914232

# Submission time Handle Problem Language Result Execution time Memory
914232 2024-01-21T11:48:31 Z Itamar Boxes with souvenirs (IOI15_boxes) C++14
100 / 100
 597 ms 257208 KB 
using namespace std;
#define ll long long
#include <vector>
#define vi vector<int>
#include <algorithm>
#define vll vector<ll>
ll delivery(int N, int K, int L, int positions[]) {
	K = min(K, N);
	ll ans = 1e18;
	vi v1, v2;
	for (int i = 0; i < N; i++) {
		if (positions[i] <= L / 2)v1.push_back(positions[i]);
		else v2.push_back(L - positions[i]);
	}
	sort(v1.begin(), v1.end());
	sort(v2.begin(), v2.end());
	int s1 = v1.size(), s2 = v2.size();
	vll dp1(1+s1), dp2(1+s2);
	for (int i = 1; i <= min(s1,K); i++) {
		dp1[i] = 2*v1[i - 1];
	}
	for (int i = K + 1; i <= s1; i++) {
		dp1[i] = 2*v1[i - 1] + dp1[i - K];
	}
	for (int i = 1; i <= min(s2, K); i++) {
		dp2[i] = 2 * v2[i - 1];
	}
	for (int i = K + 1; i <= s2; i++) {
		dp2[i] = 2 * v2[i - 1] + dp2[i - K];
	}
	ans = dp1[s1] + dp2[s2];
	for (int i = 0; i <= K; i++) {
		ans = min(ans,L+dp1[max(0,s1 - i)] + dp2[max(0,s2 - K + i)]);
	}
	return ans;
}

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:17:18: warning: conversion from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   17 |  int s1 = v1.size(), s2 = v2.size();
      |           ~~~~~~~^~
boxes.cpp:17:34: warning: conversion from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   17 |  int s1 = v1.size(), s2 = v2.size();
      |                           ~~~~~~~^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 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

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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 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
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 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 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 344 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 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
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 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 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 52 ms 25672 KB Output is correct
34 Correct 26 ms 21444 KB Output is correct
35 Correct 28 ms 22456 KB Output is correct
36 Correct 53 ms 26044 KB Output is correct
37 Correct 52 ms 25856 KB Output is correct
38 Correct 52 ms 26744 KB Output is correct
39 Correct 49 ms 24268 KB Output is correct
40 Correct 32 ms 19716 KB Output is correct
41 Correct 54 ms 25788 KB Output is correct
42 Correct 33 ms 19904 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 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
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 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 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 52 ms 25672 KB Output is correct
34 Correct 26 ms 21444 KB Output is correct
35 Correct 28 ms 22456 KB Output is correct
36 Correct 53 ms 26044 KB Output is correct
37 Correct 52 ms 25856 KB Output is correct
38 Correct 52 ms 26744 KB Output is correct
39 Correct 49 ms 24268 KB Output is correct
40 Correct 32 ms 19716 KB Output is correct
41 Correct 54 ms 25788 KB Output is correct
42 Correct 33 ms 19904 KB Output is correct
43 Correct 536 ms 257208 KB Output is correct
44 Correct 267 ms 193752 KB Output is correct
45 Correct 312 ms 185872 KB Output is correct
46 Correct 583 ms 255508 KB Output is correct
47 Correct 560 ms 256324 KB Output is correct
48 Correct 579 ms 256940 KB Output is correct
49 Correct 555 ms 243672 KB Output is correct
50 Correct 331 ms 194552 KB Output is correct
51 Correct 597 ms 256536 KB Output is correct
52 Correct 358 ms 197788 KB Output is correct