oj.uz

Submission #213169

# Submission time Handle Problem Language Result Execution time Memory
213169 2020-03-25T06:16:14 Z arman_ferdous Boxes with souvenirs (IOI15_boxes) C++17
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, l;
ll sum1[N], sum2[N];

long long delivery(int _n, int _k, int _l, int p[]) {
  n = _n, k = _k, l = _l;
  for(int i = n - 1; i >= 0; i--) {
    sum2[(n - 1 - i) % k] += (p[i] == 0 ? 0 : l - p[i]);
  }
  ll ans = sum2[(n - 1) % k];
  for(int i = 0; i < n; i++) {
    sum2[(n - 1 - i) % k] -= (p[i] == 0 ? 0 : l - p[i]);
    sum1[i % k] += p[i];
    ans = min(ans, sum1[i % k] + (n - i - 2 >= 0 ? sum2[(n - i - 2) % k] : 0));
  }
  return ans * 2ll;
}

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 384 KB Output is correct
6 Correct 5 ms 256 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 384 KB Output is correct
6 Correct 5 ms 256 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 384 KB Output is correct
6 Correct 5 ms 256 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 384 KB Output is correct
6 Correct 5 ms 256 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 -