oj.uz

Submission #469550

# Submission time Handle Problem Language Result Execution time Memory
469550 2021-09-01T10:05:47 Z Soumya1 Boxes with souvenirs (IOI15_boxes) C++17
100 / 100
 571 ms 196176 KB 
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
long long delivery(int n, int k, int l, int p[]) {
  vector<long long> dp1(n);
  for (int i = 0; i < n; i++) {
    if (i < k) dp1[i] = p[i];
    else dp1[i] = dp1[i - k] + min(p[i - k], l - p[i - k]) + p[i];
  }
  vector<long long> dp2(n);
  for (int i = n - 1; i >= 0; i--) {
    if (n - 1 - i < k) dp2[i] = l - p[i];
    else dp2[i] = dp2[i + k] + min(p[i + k], l - p[i + k]) + l - p[i];
  }
  long long ans = 1e18;
  for (int i = 0; i < n; i++) {
    if (i + k + 1 < n) {
      ans = min(ans, dp1[i] + min(p[i], l - p[i]) + l + dp2[i + k] + min(p[i + k + 1], l - p[i + k + 1]));
    }
    if (i + 1 < n) {
      ans = min(ans, dp1[i] + min(p[i], l - p[i]) + dp2[i + 1] + min(p[i + 1], l - p[i + 1]));
    }
  }
  ans = min(ans, dp1[n - 1] + min(p[n - 1], l - p[n - 1]));
  ans = min(ans, dp2[0] + min(p[0], l - p[0])); 
  return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 292 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 292 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 292 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 60 ms 20956 KB Output is correct
34 Correct 27 ms 20756 KB Output is correct
35 Correct 29 ms 20804 KB Output is correct
36 Correct 58 ms 20804 KB Output is correct
37 Correct 57 ms 20792 KB Output is correct
38 Correct 66 ms 20768 KB Output is correct
39 Correct 58 ms 20752 KB Output is correct
40 Correct 38 ms 20816 KB Output is correct
41 Correct 60 ms 20772 KB Output is correct
42 Correct 33 ms 20796 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 292 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 60 ms 20956 KB Output is correct
34 Correct 27 ms 20756 KB Output is correct
35 Correct 29 ms 20804 KB Output is correct
36 Correct 58 ms 20804 KB Output is correct
37 Correct 57 ms 20792 KB Output is correct
38 Correct 66 ms 20768 KB Output is correct
39 Correct 58 ms 20752 KB Output is correct
40 Correct 38 ms 20816 KB Output is correct
41 Correct 60 ms 20772 KB Output is correct
42 Correct 33 ms 20796 KB Output is correct
43 Correct 565 ms 196052 KB Output is correct
44 Correct 256 ms 195948 KB Output is correct
45 Correct 289 ms 196072 KB Output is correct
46 Correct 558 ms 196164 KB Output is correct
47 Correct 559 ms 196176 KB Output is correct
48 Correct 571 ms 196164 KB Output is correct
49 Correct 493 ms 196036 KB Output is correct
50 Correct 308 ms 195992 KB Output is correct
51 Correct 569 ms 196060 KB Output is correct
52 Correct 329 ms 196112 KB Output is correct