Submission #57908

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
57908	2018-07-16T13:48:08 Z	E869120	Boxes with souvenirs (IOI15_boxes)	C++14	50 / 100	71 ms	8300 KB

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) ret = (L - V1) + V2; ret *= 2;
			sum += min(1LL * L, ret);
		}
		minx = min(minx, sum);
	}

	return minx;
}

Compilation message

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++) {
                   ~~^~~~~~~~~~~~
boxes.cpp:21:4: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
    if (vec[j].first < N && vec[j].second >= N) ret = (L - V1) + V2; ret *= 2;
    ^~
boxes.cpp:21:69: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
    if (vec[j].first < N && vec[j].second >= N) ret = (L - V1) + V2; ret *= 2;
                                                                     ^~~

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	376 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	292 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	292 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	276 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	332 KB	Output is correct
3	Correct	2 ms	348 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	2 ms	348 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	256 KB	Output is correct

Subtask #4
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	376 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	292 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	292 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	2 ms	256 KB	Output is correct
14	Correct	2 ms	276 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	332 KB	Output is correct
17	Correct	2 ms	348 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	2 ms	256 KB	Output is correct
20	Correct	2 ms	348 KB	Output is correct
21	Correct	2 ms	256 KB	Output is correct
22	Correct	2 ms	256 KB	Output is correct
23	Correct	2 ms	348 KB	Output is correct
24	Correct	2 ms	256 KB	Output is correct
25	Correct	2 ms	256 KB	Output is correct
26	Correct	2 ms	256 KB	Output is correct
27	Correct	2 ms	248 KB	Output is correct
28	Correct	2 ms	256 KB	Output is correct
29	Correct	2 ms	396 KB	Output is correct
30	Correct	2 ms	256 KB	Output is correct
31	Correct	2 ms	256 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct

Subtask #5
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	376 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	292 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	292 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	2 ms	256 KB	Output is correct
14	Correct	2 ms	276 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	332 KB	Output is correct
17	Correct	2 ms	348 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	2 ms	256 KB	Output is correct
20	Correct	2 ms	348 KB	Output is correct
21	Correct	2 ms	256 KB	Output is correct
22	Correct	2 ms	256 KB	Output is correct
23	Correct	2 ms	348 KB	Output is correct
24	Correct	2 ms	256 KB	Output is correct
25	Correct	2 ms	256 KB	Output is correct
26	Correct	2 ms	256 KB	Output is correct
27	Correct	2 ms	248 KB	Output is correct
28	Correct	2 ms	256 KB	Output is correct
29	Correct	2 ms	396 KB	Output is correct
30	Correct	2 ms	256 KB	Output is correct
31	Correct	2 ms	256 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	56 ms	4220 KB	Output is correct
34	Correct	40 ms	4308 KB	Output is correct
35	Correct	41 ms	8300 KB	Output is correct
36	Correct	64 ms	4296 KB	Output is correct
37	Correct	58 ms	4448 KB	Output is correct
38	Correct	71 ms	4320 KB	Output is correct
39	Incorrect	51 ms	4184 KB	Output isn't correct
40	Halted	0 ms	0 KB	-

Subtask #6
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	376 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	292 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	292 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	2 ms	256 KB	Output is correct
14	Correct	2 ms	276 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	332 KB	Output is correct
17	Correct	2 ms	348 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	2 ms	256 KB	Output is correct
20	Correct	2 ms	348 KB	Output is correct
21	Correct	2 ms	256 KB	Output is correct
22	Correct	2 ms	256 KB	Output is correct
23	Correct	2 ms	348 KB	Output is correct
24	Correct	2 ms	256 KB	Output is correct
25	Correct	2 ms	256 KB	Output is correct
26	Correct	2 ms	256 KB	Output is correct
27	Correct	2 ms	248 KB	Output is correct
28	Correct	2 ms	256 KB	Output is correct
29	Correct	2 ms	396 KB	Output is correct
30	Correct	2 ms	256 KB	Output is correct
31	Correct	2 ms	256 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	56 ms	4220 KB	Output is correct
34	Correct	40 ms	4308 KB	Output is correct
35	Correct	41 ms	8300 KB	Output is correct
36	Correct	64 ms	4296 KB	Output is correct
37	Correct	58 ms	4448 KB	Output is correct
38	Correct	71 ms	4320 KB	Output is correct
39	Incorrect	51 ms	4184 KB	Output isn't correct
40	Halted	0 ms	0 KB	-

Submission #57908

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 10.0 / 10.0

Subtask #3 15.0 / 15.0

Subtask #4 15.0 / 15.0

Subtask #5 0 / 20.0

Subtask #6 0 / 30.0

Subtask #1
10.0 / 10.0

Subtask #2
10.0 / 10.0

Subtask #3
15.0 / 15.0

Subtask #4
15.0 / 15.0

Subtask #5
0 / 20.0

Subtask #6
0 / 30.0