oj.uz

답안 #288984

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
288984 2020-09-02T09:08:21 Z user202729 선물상자 (IOI15_boxes) C++17
100 / 100
 771 ms 73000 KB 
// moreflags=grader.cpp
//
// 10
#include "boxes.h"
#include<vector>
#include<cstdint>
#include<climits>
#include<deque>

long long delivery(int N, int K, int L, int p[]) {
	std::deque<std::pair<int, int64_t>> queue, queueAdd;
	queue.push_back({N, 0});
	queueAdd.push_back({N, 2*p[N-1]});

	for(auto index=N;;){
		--index;

		int64_t curValue=INT64_MAX;
		for(auto pointer: {&queue, &queueAdd}){
			auto& it=*pointer;
			while(it.back().first>index+K) it.pop_back();
		}
		curValue=std::min(curValue, queue.back().second+ std::min(L, 2* (L-p[index])));
		curValue=std::min(curValue, queueAdd.back().second);

		if(index==0) return curValue;

		auto const add=[&](auto& queue, int64_t value){
			while(not queue.empty() and queue.front().second>=value)
				queue.pop_front();
			queue.push_front({index, value});
		};
		add(queue, curValue);
		add(queueAdd, curValue+2*p[index-1]);
	}
}

Compilation message

boxes.cpp: In lambda function:
boxes.cpp:28:48: warning: declaration of 'queue' shadows a previous local [-Wshadow]
   28 |   auto const add=[&](auto& queue, int64_t value){
      |                                                ^
boxes.cpp:11:38: note: shadowed declaration is here
   11 |  std::deque<std::pair<int, int64_t>> queue, queueAdd;
      |                                      ^~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 0 ms 256 KB Output is correct
25 Correct 0 ms 256 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 0 ms 256 KB Output is correct
25 Correct 0 ms 256 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 61 ms 4344 KB Output is correct
34 Correct 30 ms 4784 KB Output is correct
35 Correct 33 ms 4736 KB Output is correct
36 Correct 62 ms 5216 KB Output is correct
37 Correct 61 ms 5240 KB Output is correct
38 Correct 60 ms 5240 KB Output is correct
39 Correct 57 ms 5368 KB Output is correct
40 Correct 36 ms 4736 KB Output is correct
41 Correct 68 ms 5368 KB Output is correct
42 Correct 39 ms 4736 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 0 ms 256 KB Output is correct
25 Correct 0 ms 256 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 61 ms 4344 KB Output is correct
34 Correct 30 ms 4784 KB Output is correct
35 Correct 33 ms 4736 KB Output is correct
36 Correct 62 ms 5216 KB Output is correct
37 Correct 61 ms 5240 KB Output is correct
38 Correct 60 ms 5240 KB Output is correct
39 Correct 57 ms 5368 KB Output is correct
40 Correct 36 ms 4736 KB Output is correct
41 Correct 68 ms 5368 KB Output is correct
42 Correct 39 ms 4736 KB Output is correct
43 Correct 771 ms 73000 KB Output is correct
44 Correct 315 ms 40440 KB Output is correct
45 Correct 343 ms 40868 KB Output is correct
46 Correct 628 ms 40188 KB Output is correct
47 Correct 611 ms 40304 KB Output is correct
48 Correct 587 ms 40188 KB Output is correct
49 Correct 600 ms 60188 KB Output is correct
50 Correct 402 ms 40440 KB Output is correct
51 Correct 735 ms 49660 KB Output is correct
52 Correct 396 ms 40568 KB Output is correct