oj.uz

답안 #341038

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
341038 2020-12-28T23:06:14 Z 12tqian 선물상자 (IOI15_boxes) C++17
100 / 100
 655 ms 93620 KB 
#include "boxes.h"
#include <bits/stdc++.h>
typedef long long ll;
const ll INF = 1e18;
struct MinDeque {
    int lo = 0, hi = -1;
    std::deque<std::pair<ll, int>> d;
    void ins(ll x) { // add to back
        while ((d).size() && d.back().first >= x) d.pop_back();
        d.push_back({x, ++hi});
    }
    void del() { // delete from front
        if (d.front().second == lo++) d.pop_front();
    }
    ll get() {
        return (d).size() ? d.front().first : INF;
    }
};

long long delivery(int N, int K, int L, int p[]) {
    using namespace std;
    ll ans = INF;
    MinDeque D1;
    MinDeque D2;
    D1.ins(0);
    D2.ins(2 * (L-p[0]));
    for (int i = 0; i < N; i++) {
        ll res = INF;
        res = min(res, D2.get());
        res = min(res, D1.get() + min(L, 2*p[i]));
        if (i != N-1) {
            D1.ins(res);
            D2.ins(res+2*L-2*p[i+1]);
        }
        if (i >= K-1 && i != N-1) {
            D1.del();
            D2.del();
        }
        if (i == N-1) ans = res;
    }
    return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 0 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 65 ms 13932 KB Output is correct
34 Correct 31 ms 6124 KB Output is correct
35 Correct 32 ms 6636 KB Output is correct
36 Correct 67 ms 14060 KB Output is correct
37 Correct 77 ms 14060 KB Output is correct
38 Correct 67 ms 13984 KB Output is correct
39 Correct 56 ms 12524 KB Output is correct
40 Correct 37 ms 7916 KB Output is correct
41 Correct 64 ms 14060 KB Output is correct
42 Correct 46 ms 8172 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 0 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 65 ms 13932 KB Output is correct
34 Correct 31 ms 6124 KB Output is correct
35 Correct 32 ms 6636 KB Output is correct
36 Correct 67 ms 14060 KB Output is correct
37 Correct 77 ms 14060 KB Output is correct
38 Correct 67 ms 13984 KB Output is correct
39 Correct 56 ms 12524 KB Output is correct
40 Correct 37 ms 7916 KB Output is correct
41 Correct 64 ms 14060 KB Output is correct
42 Correct 46 ms 8172 KB Output is correct
43 Correct 655 ms 93620 KB Output is correct
44 Correct 274 ms 42732 KB Output is correct
45 Correct 305 ms 42964 KB Output is correct
46 Correct 584 ms 55148 KB Output is correct
47 Correct 593 ms 55276 KB Output is correct
48 Correct 597 ms 52332 KB Output is correct
49 Correct 579 ms 70564 KB Output is correct
50 Correct 366 ms 44704 KB Output is correct
51 Correct 595 ms 55200 KB Output is correct
52 Correct 346 ms 46188 KB Output is correct