oj.uz

Submission #1006685

# Submission time Handle Problem Language Result Execution time Memory
1006685 2024-06-24T07:12:32 Z The_Samurai Boxes with souvenirs (IOI15_boxes) C++17
10 / 100
 1 ms 436 KB 
#include "boxes.h"
#include "bits/stdc++.h"
using namespace std;
using ll = long long;

ll delivery(int n, int k, int L, int p[]) {
    auto dist = [&](int i, int j) -> int {
        return min(abs(i - j), L - abs(i - j));  
    };
    sort(p, p + n);
    vector<ll> pref(n), suff(n + 1);
    int left = 0;
    bool nw = true;
    for (int i = 0; i < n; i++) {
        pref[i] = i > 0 ? pref[i - 1] : 0;
        if (left == 0) {
            left = k;
            nw = true;
        }
        pref[i] += dist(nw ? 0 : p[i - 1], p[i]) * 2;
        left--;
        nw = false;
    }
    left = 0;
    for (int i = n - 1; i >= 0; i--) {
        suff[i] = suff[i + 1];
        if (left == 0) {
            left = k;
            nw = true;
        }
        suff[i] += dist(nw ? 0 : p[i + 1], p[i]) * 2;
        left--;
        nw = false;
    }
    ll ans = min(pref[n - 1], suff[0]);
    for (int i = 1; i < n; i++) {
        ans = min(ans, pref[i] + suff[i + 1]);
    }
    return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 30.0

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