Submission #1009838

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1009838	2024-06-28T06:30:09 Z	ProtonDecay314	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	721 ms	372024 KB

boxes

/*
0 1l 2l 3l 4
1r 2r 3r

0
1l
2l = 1
3l = 2
4 = ?
1r
2r = 1
3r = 2
[3r, 3r, 3l] -> 8
[3l, 2l, 2r] -> 8
= 16

[3r, 3r, 2r] -> 6 
[3l, 3l, 2l] -> 6

1l, 2l, 3r

3l 3r 2r 2l 2l

[3l, 3r], [2l, 2l], [2r, 0l]
8 + 4 + 4 = 12

[3r, 2r], [3l, 2l], [2l, 0l]
6 + 6 + 4 = 16

10 2 10
4 3 0 1 1 2 0 5 1 6

1 1 1 2 3 4

5 6

10 7 10
7 8 1 4 3 8 7 0 4 6

4 3 10
4 9 2 9

2 4
9 9

FAILING TEST CASE:
5 3 10
2 5 8 4 3

2 3 4
5 8

2 3 4 5
8

??? Does this fail?
10 7 10
7 8 1 4 3 8 7 0 4 6

0 1 3 4
6 7 7 8 8


*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
#define first fi;
#define second se;

ll delivery(int intn, int intk, int intl, int pos_int[]) {
    ll n = intn, k = intk, l = intl;
    vll pos(n, 0ll);
    for(ll i = 0; i < n; i++) {
        pos[i] = pos_int[i];
    }

    sort(pos.begin(), pos.end());

    vll pref(n + 1, 0ll);
    vll suff(n + 1, 0ll);
    for(ll i = 1ll; i < n + 1; i++) {
        pref[i] = (i >= k ? pref[i - k] : 0ll) + pos[i - 1];
    }

    for(ll i = n - 1; i >= 0ll; i--) {
        suff[i] = (i + k <= n ? suff[i + k] : 0ll) + l - pos[i];
    }
    
    ll ans = numeric_limits<ll>::max();

    for(ll i = 0; i <= n; i++) {
        ans = min(ans, (pref[i] + suff[i]) << 1ll);
        if(i + k <= n) ans = min(ans, ((pref[i] + suff[i + k]) << 1ll) + l);
    }

    return ans;
}

#ifdef DEBUG
int main() {
    cin.tie(nullptr);
    cout.tie(nullptr);
    ios_base::sync_with_stdio(false);

    int n, k, l;
    cin >> n >> k >> l;

    vi positions(n, 0);
    for(int& pos : positions) {
        cin >> pos;
    }

    cout << delivery(n, k, l, &positions[0]) << endl;
}
#endif

Subtask #1
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	344 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	440 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	344 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	444 KB	Output is correct
7	Correct	344 KB	Output is correct

Subtask #3
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	436 KB	Output is correct
3	Correct	0 ms	432 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct

Subtask #4
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	440 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	444 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	436 KB	Output is correct
17	Correct	0 ms	432 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	0 ms	604 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	344 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	440 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	444 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	436 KB	Output is correct
17	Correct	0 ms	432 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	0 ms	604 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	344 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	67 ms	37448 KB	Output is correct
34	Correct	35 ms	29744 KB	Output is correct
35	Correct	37 ms	30116 KB	Output is correct
36	Correct	58 ms	37572 KB	Output is correct
37	Correct	58 ms	37544 KB	Output is correct
38	Correct	60 ms	37424 KB	Output is correct
39	Correct	61 ms	35924 KB	Output is correct
40	Correct	41 ms	31312 KB	Output is correct
41	Correct	68 ms	37496 KB	Output is correct
42	Correct	41 ms	31568 KB	Output is correct

Subtask #6
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	440 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	444 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	436 KB	Output is correct
17	Correct	0 ms	432 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	0 ms	604 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	344 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	67 ms	37448 KB	Output is correct
34	Correct	35 ms	29744 KB	Output is correct
35	Correct	37 ms	30116 KB	Output is correct
36	Correct	58 ms	37572 KB	Output is correct
37	Correct	58 ms	37544 KB	Output is correct
38	Correct	60 ms	37424 KB	Output is correct
39	Correct	61 ms	35924 KB	Output is correct
40	Correct	41 ms	31312 KB	Output is correct
41	Correct	68 ms	37496 KB	Output is correct
42	Correct	41 ms	31568 KB	Output is correct
43	Correct	721 ms	370948 KB	Output is correct
44	Correct	359 ms	293784 KB	Output is correct
45	Correct	391 ms	301508 KB	Output is correct
46	Correct	635 ms	371924 KB	Output is correct
47	Correct	632 ms	372024 KB	Output is correct
48	Correct	667 ms	372012 KB	Output is correct
49	Correct	645 ms	356724 KB	Output is correct
50	Correct	450 ms	310768 KB	Output is correct
51	Correct	697 ms	371900 KB	Output is correct
52	Correct	435 ms	313408 KB	Output is correct

Submission #1009838

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 20.0 / 20.0

Subtask #6 30.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
20.0 / 20.0

Subtask #6
30.0 / 30.0