oj.uz

Submission #72803

# Submission time Handle Problem Language Result Execution time Memory
72803 2018-08-27T01:59:32 Z square1001 Boxes with souvenirs (IOI15_boxes) C++14
70 / 100
 896 ms 313920 KB 
#include "boxes.h"
#include <vector>
#include <algorithm>
using namespace std;

long long delivery(int N, int K, int L, int p[]) {
    vector<int> lv, rv;
    for(int i = 0; i < N; ++i) {
		if(2 * p[i] < L) {
			lv.push_back(p[i]);
		}
		else {
			rv.push_back(L - p[i]);
		}
	}
	sort(lv.begin(), lv.end());
	sort(rv.begin(), rv.end());
	int ls = lv.size(), rs = rv.size();
	vector<long long> ld(ls + 1), rd(rs + 1);
	for(int i = 1; i <= ls; ++i) {
		ld[i] = (i < K ? 0 : ld[i - K]) + 2 * lv[i - 1];
	}
	for(int i = 1; i <= rs; ++i) {
		rd[i] = (i < K ? 0 : rd[i - K]) + 2 * rv[i - 1];
	}
	long long ret = ld[ls] + rd[rs];
	for(int i = ls - K + 1; i <= ls && i <= N - K; ++i) {
		ret = min(ret, ld[i] + rd[N - K - i] + L);
	}
	return ret;
}

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:18:18: warning: conversion to 'int' from 'std::vector<int>::size_type {aka long unsigned int}' may alter its value [-Wconversion]
  int ls = lv.size(), rs = rv.size();
           ~~~~~~~^~
boxes.cpp:18:34: warning: conversion to 'int' from 'std::vector<int>::size_type {aka long unsigned int}' may alter its value [-Wconversion]
  int ls = lv.size(), rs = rv.size();
                           ~~~~~~~^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 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 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 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 256 KB Output is correct
3 Correct 2 ms 296 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 256 KB Output is correct
7 Correct 2 ms 256 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 256 KB Output is correct
3 Correct 2 ms 276 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 252 KB Output is correct
6 Correct 2 ms 252 KB Output is correct
7 Correct 2 ms 380 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 348 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 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 296 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 276 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 252 KB Output is correct
20 Correct 2 ms 252 KB Output is correct
21 Correct 2 ms 380 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 256 KB Output is correct
24 Correct 2 ms 252 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 256 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 256 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 348 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 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 296 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 276 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 252 KB Output is correct
20 Correct 2 ms 252 KB Output is correct
21 Correct 2 ms 380 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 256 KB Output is correct
24 Correct 2 ms 252 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 256 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 256 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 63 ms 16056 KB Output is correct
34 Correct 40 ms 18016 KB Output is correct
35 Correct 40 ms 16100 KB Output is correct
36 Correct 63 ms 16096 KB Output is correct
37 Correct 62 ms 15972 KB Output is correct
38 Correct 67 ms 16992 KB Output is correct
39 Correct 61 ms 16132 KB Output is correct
40 Correct 43 ms 16072 KB Output is correct
41 Correct 64 ms 16096 KB Output is correct
42 Correct 46 ms 16104 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 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 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 296 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 276 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 252 KB Output is correct
20 Correct 2 ms 252 KB Output is correct
21 Correct 2 ms 380 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 256 KB Output is correct
24 Correct 2 ms 252 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 256 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 256 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 63 ms 16056 KB Output is correct
34 Correct 40 ms 18016 KB Output is correct
35 Correct 40 ms 16100 KB Output is correct
36 Correct 63 ms 16096 KB Output is correct
37 Correct 62 ms 15972 KB Output is correct
38 Correct 67 ms 16992 KB Output is correct
39 Correct 61 ms 16132 KB Output is correct
40 Correct 43 ms 16072 KB Output is correct
41 Correct 64 ms 16096 KB Output is correct
42 Correct 46 ms 16104 KB Output is correct
43 Correct 664 ms 156996 KB Output is correct
44 Correct 396 ms 173312 KB Output is correct
45 Correct 455 ms 157068 KB Output is correct
46 Correct 695 ms 157016 KB Output is correct
47 Correct 651 ms 156916 KB Output is correct
48 Correct 682 ms 157000 KB Output is correct
49 Correct 670 ms 156996 KB Output is correct
50 Correct 463 ms 157004 KB Output is correct
51 Runtime error 896 ms 313920 KB Execution killed with signal 11 (could be triggered by violating memory limits)
52 Halted 0 ms 0 KB -