oj.uz

Submission #947005

# Submission time Handle Problem Language Result Execution time Memory
947005 2024-03-15T10:05:08 Z Nelt Boxes with souvenirs (IOI15_boxes) C++17
10 / 100
 1 ms 440 KB 
#include <bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;
ll delivery(int n, int k, int L, int p[]) {
    ll ans = 1e18;
    ll pref[n], suf[n];
    for (ll i = 0; i < n; i++)
        pref[i] = (i - k < 0 ? 0 : pref[i - k]) + p[i];
    for (ll i = n - 1; i >= 0; i--)
        suf[i] = (i + k >= n ? 0 : suf[i + k]) + L - p[i];
    for (ll i = -1; i < n; i++)
        ans = min(ans, (i >= 0 ? pref[i] : 0) * 2 + (i + 1 < n ? suf[i + 1] : 0) * 2);
    for (ll i = 0; i < n; i++)
        if (L < min(p[i] * 2, (L - p[i]) * 2))
        ans = min(ans, (i - 1 >= 0 ? pref[i - 1] : 0) * 2 + L + (i + k < n ? suf[i + k] : 0) * 2);
    return ans;
}
// void solve()
// {
    
// }

// signed main()
// {
//     ios_base::sync_with_stdio(0);
//     cin.tie(0);
//     ll t = 1;
//     // precomp();
//     // cin >> t;
//     for (ll i = 1; i <= t; i++)
//         solve();
//     cerr << "\nTime elapsed: " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
// }

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 440 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 348 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 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 0 ms 348 KB Output is correct
2 Correct 0 ms 440 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 348 KB Output is correct
8 Incorrect 0 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 0 ms 348 KB Output is correct
2 Correct 0 ms 440 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 348 KB Output is correct
8 Incorrect 0 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 0 ms 348 KB Output is correct
2 Correct 0 ms 440 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 348 KB Output is correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -