oj.uz

Submission #931972

# Submission time Handle Problem Language Result Execution time Memory
931972 2024-02-22T16:56:14 Z Art_ogo Boxes with souvenirs (IOI15_boxes) C++17
100 / 100
 438 ms 293996 KB 
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <algorithm>
#include <utility>
#include <vector>
#include <iostream>
#include "boxes.h"

#define ll long long
#define ve vector

using namespace std;

int dst(int x, int L){
    return min(x, L - x);
}

long long delivery(int N, int K, int L, int p[]) {
    ve<ll> dpl(N), dpr(N);
    int cnt = 1;
    for(int i = 0; i < N; i++){
        if(i - K >= 0)
            dpl[i] = p[i] - p[i - K] + dpl[i - K] + 2*p[i - K];
        else dpl[i] = p[i];
    }
    for(int i = N - 1; i >= 0; i--){
        if(i + K < N)
            dpr[i] = p[i + K] - p[i] + dpr[i + K] + 2*(L - p[i + K]);
        else dpr[i] = L - p[i];
    }
    ll res = min(dpl[N - 1] + dst(p[N - 1], L), dpr[0] + dst(p[0], L));
    for(int i = 0; i < N - 1; i++)
        res = min(res, dpl[i] + dst(p[i], L) + dpr[i + 1] + dst(p[i + 1], L));
    return res;
}

//
//static char _buffer[1024];
//static int _currentChar = 0;
//static int _charsNumber = 0;
//static FILE *_inputFile, *_outputFile;
//
//static inline int _read() {
//    if (_charsNumber < 0) {
//        exit(1);
//    }
//    if (!_charsNumber || _currentChar == _charsNumber) {
//        _charsNumber = (int)fread(_buffer, sizeof(_buffer[0]), sizeof(_buffer), _inputFile);
//        _currentChar = 0;
//    }
//    if (_charsNumber <= 0) {
//        return -1;
//    }
//    return _buffer[_currentChar++];
//}
//
//static inline int _readInt() {
//    int x;
//    std::cin >> x;
//    return x;
//}
//
//int main() {
//    _inputFile = fopen("boxes.in", "rb");
//    _outputFile = fopen("boxes.out", "w");
//    
//    int N, K, L, i;
//    N = _readInt();
//    K = _readInt();
//    L = _readInt();
//    
//    int *p = (int*)malloc(sizeof(int) * (unsigned int)N);
//    
//    for (i = 0; i < N; i++) {
//        p[i] = _readInt();
//    }
//    cout << delivery(N, K, L, p);
//    return 0;
//}

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:22:9: warning: unused variable 'cnt' [-Wunused-variable]
   22 |     int cnt = 1;
      |         ^~~

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 344 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 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 344 KB Output is correct
5 Correct 1 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 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 344 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 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
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 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 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 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 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 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 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 344 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 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
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 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 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 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 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 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 1 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 44 ms 29564 KB Output is correct
34 Correct 19 ms 21852 KB Output is correct
35 Correct 17 ms 22360 KB Output is correct
36 Correct 42 ms 29748 KB Output is correct
37 Correct 42 ms 29776 KB Output is correct
38 Correct 42 ms 29524 KB Output is correct
39 Correct 37 ms 28240 KB Output is correct
40 Correct 22 ms 23464 KB Output is correct
41 Correct 44 ms 29584 KB Output is correct
42 Correct 23 ms 23892 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 344 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 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
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 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 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 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 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 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 1 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 44 ms 29564 KB Output is correct
34 Correct 19 ms 21852 KB Output is correct
35 Correct 17 ms 22360 KB Output is correct
36 Correct 42 ms 29748 KB Output is correct
37 Correct 42 ms 29776 KB Output is correct
38 Correct 42 ms 29524 KB Output is correct
39 Correct 37 ms 28240 KB Output is correct
40 Correct 22 ms 23464 KB Output is correct
41 Correct 44 ms 29584 KB Output is correct
42 Correct 23 ms 23892 KB Output is correct
43 Correct 438 ms 292576 KB Output is correct
44 Correct 140 ms 215844 KB Output is correct
45 Correct 165 ms 223256 KB Output is correct
46 Correct 412 ms 293996 KB Output is correct
47 Correct 415 ms 293732 KB Output is correct
48 Correct 413 ms 293608 KB Output is correct
49 Correct 360 ms 278480 KB Output is correct
50 Correct 198 ms 232356 KB Output is correct
51 Correct 409 ms 293844 KB Output is correct
52 Correct 206 ms 235092 KB Output is correct