oj.uz

Submission #314156

# Submission time Handle Problem Language Result Execution time Memory
314156 2020-10-18T19:29:41 Z joseacaz Boxes with souvenirs (IOI15_boxes) C++17
0 / 100
 1 ms 384 KB 
#include "boxes.h"
#include <bits/stdc++.h>
#define pb push_back

using namespace std;
typedef long long ll;
typedef vector<int> vi;

const int MAXN = 1e7 + 5;
int N, K, L;
ll pre[MAXN], suf[MAXN];

ll delivery(int _n, int _k, int _l, int p[])
{
    N = _n, K = _k, L = _l;
    for(int i = 0; i < N; i++)
        pre[i] = (i - K >= 0 ? pre[i - K] : 0) + 2*p[i];
    for(int i = N - 1; i >= 0; i--)
        suf[i] = (i + K < N ? suf[i + K] : 0) + 2*(L-p[i]);
    
    ll ans = min(min(pre[N - 1], suf[0]), min(L + suf[K], pre[N - K - 1] + K));
    for(int i = 0; i < N - 1; i++)
        ans = min(ans, pre[i] + suf[i + 1]);
    for(int i = 0; i < N - K - 1; i++)
        ans = min(ans, pre[i] + suf[i + K + 1] + L);
    return ans;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Incorrect 0 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 30.0

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