Submission #802333

# Submission time Handle Problem Language Result Execution time Memory
802333 2023-08-02T11:40:43 Z Liudas Boxes with souvenirs (IOI15_boxes) C++17
100 / 100
483 ms 195988 KB
#include <bits/stdc++.h>
#include "boxes.h"
using namespace std;
vector<long long> get_cost(int N, int K, int L, int pos[]){
    vector<long long> arr(N, 0);
    for(int i = 0; i < N; i ++){
        arr[i] += pos[i];
        if(i >= K)arr[i] += arr[i-K] + pos[i-K];
    }
    return arr;
}
long long delivery(int N, int K, int L, int pos[]){
    int z = count(pos, pos+N, 0);
    N-=z;
    for(int i = 0; i < N; i++){
        pos[i] = pos[i+z];
    }
    vector<long long> l, r;
    l = get_cost(N, K, L, pos);
    reverse(pos, pos + N);
    for(int i = 0; i < N; i ++){
        pos[i] = (pos[i] ? L - pos[i] : pos[i]);
    }
    r = get_cost(N, K, L, pos);
    long long ans = min({l.back()+pos[0], l.back()+L-pos[0], r.back()+pos[N-1], r.back()-pos[N-1]+L});
    reverse(pos, pos + N);
    reverse(r.begin(), r.end());
    for(int i = 0; i < N - 1; i ++){
        ans = min(ans, l[i]+r[i+1]+min(L-pos[i],pos[i])+min(L-pos[i+1], pos[i+1]));
    }
    return ans;
}

Compilation message

boxes.cpp: In function 'std::vector<long long int> get_cost(int, int, int, int*)':
boxes.cpp:4:46: warning: unused parameter 'L' [-Wunused-parameter]
    4 | vector<long long> get_cost(int N, int K, int L, int pos[]){
      |                                          ~~~~^
boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:13:18: warning: conversion from 'std::iterator_traits<int*>::difference_type' {aka 'long int'} to 'int' may change value [-Wconversion]
   13 |     int z = count(pos, pos+N, 0);
      |             ~~~~~^~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 244 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 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 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 244 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 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 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 244 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 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 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 49 ms 19864 KB Output is correct
34 Correct 17 ms 16692 KB Output is correct
35 Correct 23 ms 18972 KB Output is correct
36 Correct 47 ms 19828 KB Output is correct
37 Correct 50 ms 19836 KB Output is correct
38 Correct 51 ms 19820 KB Output is correct
39 Correct 45 ms 19864 KB Output is correct
40 Correct 26 ms 19788 KB Output is correct
41 Correct 48 ms 19864 KB Output is correct
42 Correct 30 ms 19840 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 244 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 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 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 49 ms 19864 KB Output is correct
34 Correct 17 ms 16692 KB Output is correct
35 Correct 23 ms 18972 KB Output is correct
36 Correct 47 ms 19828 KB Output is correct
37 Correct 50 ms 19836 KB Output is correct
38 Correct 51 ms 19820 KB Output is correct
39 Correct 45 ms 19864 KB Output is correct
40 Correct 26 ms 19788 KB Output is correct
41 Correct 48 ms 19864 KB Output is correct
42 Correct 30 ms 19840 KB Output is correct
43 Correct 478 ms 195984 KB Output is correct
44 Correct 194 ms 164668 KB Output is correct
45 Correct 227 ms 192848 KB Output is correct
46 Correct 483 ms 195920 KB Output is correct
47 Correct 483 ms 195944 KB Output is correct
48 Correct 480 ms 195988 KB Output is correct
49 Correct 452 ms 195916 KB Output is correct
50 Correct 262 ms 195596 KB Output is correct
51 Correct 467 ms 195984 KB Output is correct
52 Correct 280 ms 195980 KB Output is correct