oj.uz

답안 #711340

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
711340 2023-03-16T16:15:43 Z Nhoksocqt1 선물상자 (IOI15_boxes) C++17
100 / 100
 764 ms 336016 KB 
#include<bits/stdc++.h>
using namespace std;

#define inf 0x3f3f3f3f
#define sz(x) int((x).size())
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> ii;

template<class X, class Y>
	inline bool maximize(X &x, const Y &y) {return (x < y ? x = y, 1 : 0);}
template<class X, class Y>
	inline bool minimize(X &x, const Y &y) {return (x > y ? x = y, 1 : 0);}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int Random(int l, int r) {
    return uniform_int_distribution<int>(l, r)(rng);
}

const int MAXN = 1e7+7;

ll dpL[MAXN], dpR[MAXN];
int a[MAXN], nArr, k, L;

#ifdef Nhoksocqt1

ll delivery(int _N, int _K, int _L, int _pos[]);

int _P[MAXN];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    freopen("BOXES.inp", "r", stdin);
    freopen("BOXES.out", "w", stdout);

    int N, K, L;
    cin >> N >> K >> L;
    //N = Random(1, 10), K = Random(1, N), L = Random(1, 1e9); cout << N << ' ' << K << ' ' << L << '\n';
    for (int i = 0; i < N; ++i)
        cin >> _P[i];

    //for (int i = 0; i < N; ++i) _P[i] = Random(0, L - 1); sort(_P, _P + N); for (int i = 0; i < N; ++i) cout << _P[i] << " \n"[i + 1 == N];

    cout << delivery(N, K, L, _P) << '\n';
    return 0;
}

#endif // Nhoksocqt1

ll delivery(int _N, int _K, int _L, int _pos[]) {
    nArr = _N, k = _K, L = _L;

    int cnt0(0);
    while(cnt0 < nArr && _pos[cnt0] == 0)
        ++cnt0;

    for (int i = cnt0 + 1; i <= nArr; ++i)
        a[i - cnt0] = _pos[i - 1];

    nArr = _N - cnt0;

    for (int i = 0; i <= nArr + 1; ++i)
        dpL[i] = dpR[i] = 1e18;

    dpL[0] = dpR[nArr + 1] = 0;

    deque<int> dq;
    dq.push_back(0);

    for (int i = 1; i <= nArr; ++i) {
        dpL[i] = dpL[dq.front()] + min(L, 2 * a[i]);
        while(dq.size() && dpL[dq.back()] >= dpL[i])
            dq.pop_back();

        dq.push_back(i);
        if(dq.front() + k <= i)
            dq.pop_front();
    }

    while(dq.size())
        dq.pop_back();

    dq.push_back(nArr + 1);
    for (int i = nArr; i > 0; --i) {
        dpR[i] = dpR[dq.front()] + min(L, 2 * (L - a[i]));
        while(dq.size() && dpR[dq.back()] >= dpR[i])
            dq.pop_back();

        dq.push_back(i);
        if(dq.front() - k >= i)
            dq.pop_front();
    }

    ll result(1e18);
    for (int i = 0; i <= nArr; ++i)
        result = min(result, dpL[i] + dpR[i + 1]);

    return result;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 64 ms 33428 KB Output is correct
34 Correct 37 ms 21760 KB Output is correct
35 Correct 34 ms 25268 KB Output is correct
36 Correct 70 ms 33496 KB Output is correct
37 Correct 78 ms 33592 KB Output is correct
38 Correct 69 ms 33516 KB Output is correct
39 Correct 58 ms 32044 KB Output is correct
40 Correct 44 ms 27308 KB Output is correct
41 Correct 68 ms 33484 KB Output is correct
42 Correct 48 ms 27724 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 64 ms 33428 KB Output is correct
34 Correct 37 ms 21760 KB Output is correct
35 Correct 34 ms 25268 KB Output is correct
36 Correct 70 ms 33496 KB Output is correct
37 Correct 78 ms 33592 KB Output is correct
38 Correct 69 ms 33516 KB Output is correct
39 Correct 58 ms 32044 KB Output is correct
40 Correct 44 ms 27308 KB Output is correct
41 Correct 68 ms 33484 KB Output is correct
42 Correct 48 ms 27724 KB Output is correct
43 Correct 640 ms 336016 KB Output is correct
44 Correct 321 ms 215628 KB Output is correct
45 Correct 353 ms 258604 KB Output is correct
46 Correct 710 ms 332612 KB Output is correct
47 Correct 716 ms 330880 KB Output is correct
48 Correct 692 ms 332436 KB Output is correct
49 Correct 703 ms 320068 KB Output is correct
50 Correct 414 ms 271168 KB Output is correct
51 Correct 764 ms 333148 KB Output is correct
52 Correct 449 ms 273960 KB Output is correct