oj.uz

Submission #213267

# Submission time Handle Problem Language Result Execution time Memory
213267 2020-03-25T11:46:44 Z arman_ferdous Boxes with souvenirs (IOI15_boxes) C++14
10 / 100
 5 ms 384 KB 
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
const int N = 1e7+10;
int n, k; ll l;
ll dp1[N], dp2[N];

long long delivery(int _n, int _k, int _l, int p[]) {
  n = _n, k = _k, l = _l;
  for(int i = 0; i < n; i++) {
    if(i < k) dp1[i] = 2ll * p[i];
    else dp1[i] = 2ll * p[i] + dp1[i - k];
  }
  for(int i = n - 1; i >= 0; i--) {
    if(n - 1 < i + k) dp2[i] = 2ll * (p[i] == 0 ? 0 : l - p[i]);
    else dp2[i] = 2ll * (p[i] == 0 ? 0 : l - p[i]) + dp2[i + k];
  }
  ll ans = min(dp1[n - 1], dp2[0]);
  for(int i = 0; i + 1 < n; i++)
    ans = min(ans, dp1[i] + dp2[i + 1]);
  for(int i = 0; i < n; i++) {
    ll one = (i ? dp1[i - 1] : 0);
    ll two = (i + k < n ? dp2[i + k] : 0);
    ans = min(ans, l + one + two);
  }
  return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 360 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Incorrect 5 ms 384 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 360 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Incorrect 5 ms 384 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 360 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Incorrect 5 ms 384 KB Output isn't correct
9 Halted 0 ms 0 KB -