oj.uz

Submission #320365

# Submission time Handle Problem Language Result Execution time Memory
320365 2020-11-08T11:04:42 Z nikatamliani Boxes with souvenirs (IOI15_boxes) C++14
0 / 100
 1 ms 364 KB 
#include <bits/stdc++.h>
#include "boxes.h"
using namespace std;
long long delivery(int N, int K, int L, int positions[]) {
    long long p[N], s[N];
    for(int i = 0; i < N; ++i) {
        p[i] = positions[i];
        if(i >= K) {
            p[i] += p[i - K];
        } 
        p[i] *= 2; 
    }
    for(int i = N - 1; i >= 0; --i) {
        s[i] = L - positions[i];
        if(i + K < N) {
            s[i] += s[i + K]; 
        }
        s[i] *= 2;
    }
    long long answer = p[N - 1];
    for(int i = 0; i < N - 1; ++i) {
        answer = min(answer, p[i] + s[i + 1]);
    }
    for(int start = 0; start + K - 1 < N; ++start) {
        int end = start + K - 1;
        long long left = (start > 0 ? p[start - 1] : 0);
        long long right = (end < N - 1 ? s[end + 1] : 0);
        long long middle = L;
        answer = min(answer, left + middle + right);
    }
    return answer;
}
// int main() {
//     int pos[] = {1, 2, 5};
//     cout << delivery(3, 2, 8, pos) << '\n';
// }

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 30.0

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