oj.uz

Submission #74711

# Submission time Handle Problem Language Result Execution time Memory
74711 2018-09-06T17:47:50 Z doowey Boxes with souvenirs (IOI15_boxes) C++14
100 / 100
 543 ms 170968 KB 
#include "boxes.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

vector<ll> bef, aft;

ll delivery(int N, int K, int L, int p[]) {
	for(int i = 0; i < N; i ++ ){
		if(p[i] <= L/2)
			bef.push_back(p[i] * 2);
		else
			aft.push_back((L-p[i])*2);
	}
	reverse(aft.begin(), aft.end());
	for(int i = K; i < bef.size(); i ++ )
		bef[i] += bef[i-K];
	for(int i = K; i < aft.size(); i ++ )
		aft[i] += aft[i - K];
	int tr;
	ll ans = (ll)1e18;
	ll sum;
	for(int tl = 1; tl <= K; tl ++ ){
		tr = K-tl;
		sum = L;
		if(tl < (int)bef.size())
			sum += bef[bef.size()-tl-1];
		if(tr < (int)aft.size())
			sum += aft[aft.size()-tr-1];
		ans = min(ans, sum);
	}
	sum = 0;
	if(!bef.empty())
		sum += bef.back();
	if(!aft.empty())
		sum += aft.back();
	ans = min(ans, sum);
	return ans;
}

Compilation message

boxes.cpp: In function 'll delivery(int, int, int, int*)':
boxes.cpp:18:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = K; i < bef.size(); i ++ )
                 ~~^~~~~~~~~~~~
boxes.cpp:20:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = K; i < aft.size(); i ++ )
                 ~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 252 KB Output is correct
3 Correct 7 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 300 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 252 KB Output is correct
17 Correct 7 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 380 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 8 ms 376 KB Output is correct
28 Correct 2 ms 256 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 300 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 252 KB Output is correct
17 Correct 7 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 380 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 8 ms 376 KB Output is correct
28 Correct 2 ms 256 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 48 ms 14292 KB Output is correct
34 Correct 28 ms 16168 KB Output is correct
35 Correct 28 ms 16212 KB Output is correct
36 Correct 47 ms 12564 KB Output is correct
37 Correct 48 ms 12768 KB Output is correct
38 Correct 48 ms 14172 KB Output is correct
39 Correct 44 ms 14440 KB Output is correct
40 Correct 29 ms 14304 KB Output is correct
41 Correct 47 ms 12512 KB Output is correct
42 Correct 29 ms 12512 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 300 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 252 KB Output is correct
17 Correct 7 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 380 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 8 ms 376 KB Output is correct
28 Correct 2 ms 256 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 48 ms 14292 KB Output is correct
34 Correct 28 ms 16168 KB Output is correct
35 Correct 28 ms 16212 KB Output is correct
36 Correct 47 ms 12564 KB Output is correct
37 Correct 48 ms 12768 KB Output is correct
38 Correct 48 ms 14172 KB Output is correct
39 Correct 44 ms 14440 KB Output is correct
40 Correct 29 ms 14304 KB Output is correct
41 Correct 47 ms 12512 KB Output is correct
42 Correct 29 ms 12512 KB Output is correct
43 Correct 525 ms 144452 KB Output is correct
44 Correct 253 ms 135708 KB Output is correct
45 Correct 300 ms 145944 KB Output is correct
46 Correct 525 ms 170968 KB Output is correct
47 Correct 484 ms 119812 KB Output is correct
48 Correct 523 ms 170924 KB Output is correct
49 Correct 494 ms 144416 KB Output is correct
50 Correct 331 ms 144428 KB Output is correct
51 Correct 543 ms 170952 KB Output is correct
52 Correct 365 ms 170880 KB Output is correct