oj.uz

Submission #852686

# Submission time Handle Problem Language Result Execution time Memory
852686 2023-09-22T14:01:53 Z ntkphong Boxes with souvenirs (IOI15_boxes) C++14
100 / 100
 681 ms 333140 KB 
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
 
const long long INF = 1e18;
 
long long delivery(int N, int K, int L, int p[]) {
    
    vector<int> positions(N);
    for(int i = 0; i < N; i ++) positions[i] = p[i]; 
    
    sort(positions.begin(), positions.end());
    
    /*for(int i = 0; i < N; i ++) {
        if(positions[i] == 0) {
            K -- ;
            positions.erase(positions.begin());
        }
    }*/
    
    vector<long long> f(N);
    vector<long long> s(N);
    
    for(int i = 0, j = 0; i < N; i ++) {
        j = max(j, i - K + 1);
        f[i] = (j == 0 ? 0 : f[j - 1]) + positions[i] * 2;
    }
    
    for(int i = N - 1, j = N - 1; i >= 0; i --) {
        j = min(j, i + K - 1);
        s[i] = (j == N - 1 ? 0 : s[j + 1]) + (L - positions[i]) * 2;
    }
    
    long long ans = INF;
    
    for(int i = 0; i < N; i ++) {
        ans = min(ans, (i > 0 ? f[i - 1] : 0) + (i < N ? s[i] : 0));
        ans = min(ans, (i >= 0 ? f[i] : 0) + (i + 1 < N ? s[i + 1] : 0));
        
        //cout << i << " " << (i > 0 ? f[i - 1] : 0) + (i < N ? s[i] : 0) << "\n";
        //cout << i << " " << (i >= 0 ? f[i] : 0) + (i + 1 < N ? s[i + 1] : 0) << "\n";
    }
    
    for(int i = 0, j = 0; i < N; i ++) {
        j = max(j, i - K + 1);
        ans = min(ans, (j > 0 ? f[j - 1] : 0) + (i + 1 < N ? s[i + 1] : 0) + L);
    }
    
    return ans;
}
 
/*int main() {
    int N, K, L;
    cin >> N >> K >> L;
    
    int p[N];
    for(int i = 0; i < N; i ++) cin >> p[i];
    
    cout << delivery(N, K, L, p) << "\n";
    return 0;
}*/

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 408 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 ms 344 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 408 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 60 ms 33420 KB Output is correct
34 Correct 30 ms 25680 KB Output is correct
35 Correct 36 ms 26188 KB Output is correct
36 Correct 56 ms 33616 KB Output is correct
37 Correct 58 ms 33656 KB Output is correct
38 Correct 57 ms 33660 KB Output is correct
39 Correct 57 ms 32156 KB Output is correct
40 Correct 37 ms 27472 KB Output is correct
41 Correct 61 ms 33616 KB Output is correct
42 Correct 40 ms 27784 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 408 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 60 ms 33420 KB Output is correct
34 Correct 30 ms 25680 KB Output is correct
35 Correct 36 ms 26188 KB Output is correct
36 Correct 56 ms 33616 KB Output is correct
37 Correct 58 ms 33656 KB Output is correct
38 Correct 57 ms 33660 KB Output is correct
39 Correct 57 ms 32156 KB Output is correct
40 Correct 37 ms 27472 KB Output is correct
41 Correct 61 ms 33616 KB Output is correct
42 Correct 40 ms 27784 KB Output is correct
43 Correct 626 ms 332148 KB Output is correct
44 Correct 325 ms 254968 KB Output is correct
45 Correct 334 ms 262476 KB Output is correct
46 Correct 681 ms 332888 KB Output is correct
47 Correct 601 ms 333096 KB Output is correct
48 Correct 588 ms 332984 KB Output is correct
49 Correct 610 ms 317940 KB Output is correct
50 Correct 371 ms 271816 KB Output is correct
51 Correct 647 ms 333140 KB Output is correct
52 Correct 381 ms 274388 KB Output is correct