oj.uz

Submission #937624

# Submission time Handle Problem Language Result Execution time Memory
937624 2024-03-04T09:46:36 Z danikoynov Boxes with souvenirs (IOI15_boxes) C++14
20 / 100
 12 ms 2648 KB 
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const ll inf = 1e18;
const int maxn = 1e7 + 10;

int n, k;
ll p[maxn], temp[maxn];
ll L;

ll get_price_left(int x)
{
    ll res = 0;
    int t = 0;
    for (int i = 0; i < x; i ++)
    {
        t ++;
        if (t == x || t % k == 0)
        res = res + 2 * p[i];
    }
    return res;
}

ll get_price_right(int x)
{
    ll res = 0;
    int t = 0;
    for (int i = n - 1; i >= n - x; i --)
    {
        t ++;
        if (t == x || t % k == 0)
        res = res + 2 * (L - p[i]);
    }
    return res;
}

long long delivery(int N, int K, int _L, int P[])
{
    for (int i = 0; i < N; i ++)
        p[i] = P[i];

    n = N;
    k = K;
    L = _L;



    //cout << get_price_right(1) << endl;
    ///exit(0);
    ll res = inf;
    for (int i = 0; i <= N; i ++)
    {
        ll val = get_price_left(i) + get_price_right(N - i);

        //cout << i << " " << val << endl;
        res = min(res, val);
        if (N - i - k >= 0)
        {
            val = get_price_left(i) + get_price_right(N - i - k) + L;
            res = min(res, val);
        }
    }


    return res;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 11 ms 2396 KB Output is correct
3 Correct 11 ms 2396 KB Output is correct
4 Correct 12 ms 2396 KB Output is correct
5 Correct 11 ms 2396 KB Output is correct
6 Correct 11 ms 2500 KB Output is correct
7 Correct 11 ms 2396 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2648 KB Output is correct
2 Correct 5 ms 2396 KB Output is correct
3 Correct 5 ms 2512 KB Output is correct
4 Correct 5 ms 2648 KB Output is correct
5 Correct 5 ms 2396 KB Output is correct
6 Correct 5 ms 2396 KB Output is correct
7 Correct 5 ms 2396 KB Output is correct

Subtask #3
0 / 15.0

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

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 11 ms 2396 KB Output is correct
3 Correct 11 ms 2396 KB Output is correct
4 Correct 12 ms 2396 KB Output is correct
5 Correct 11 ms 2396 KB Output is correct
6 Correct 11 ms 2500 KB Output is correct
7 Correct 11 ms 2396 KB Output is correct
8 Correct 5 ms 2648 KB Output is correct
9 Correct 5 ms 2396 KB Output is correct
10 Correct 5 ms 2512 KB Output is correct
11 Correct 5 ms 2648 KB Output is correct
12 Correct 5 ms 2396 KB Output is correct
13 Correct 5 ms 2396 KB Output is correct
14 Correct 5 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2500 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Incorrect 1 ms 2396 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 11 ms 2396 KB Output is correct
3 Correct 11 ms 2396 KB Output is correct
4 Correct 12 ms 2396 KB Output is correct
5 Correct 11 ms 2396 KB Output is correct
6 Correct 11 ms 2500 KB Output is correct
7 Correct 11 ms 2396 KB Output is correct
8 Correct 5 ms 2648 KB Output is correct
9 Correct 5 ms 2396 KB Output is correct
10 Correct 5 ms 2512 KB Output is correct
11 Correct 5 ms 2648 KB Output is correct
12 Correct 5 ms 2396 KB Output is correct
13 Correct 5 ms 2396 KB Output is correct
14 Correct 5 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2500 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Incorrect 1 ms 2396 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 11 ms 2396 KB Output is correct
3 Correct 11 ms 2396 KB Output is correct
4 Correct 12 ms 2396 KB Output is correct
5 Correct 11 ms 2396 KB Output is correct
6 Correct 11 ms 2500 KB Output is correct
7 Correct 11 ms 2396 KB Output is correct
8 Correct 5 ms 2648 KB Output is correct
9 Correct 5 ms 2396 KB Output is correct
10 Correct 5 ms 2512 KB Output is correct
11 Correct 5 ms 2648 KB Output is correct
12 Correct 5 ms 2396 KB Output is correct
13 Correct 5 ms 2396 KB Output is correct
14 Correct 5 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2500 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Incorrect 1 ms 2396 KB Output isn't correct
21 Halted 0 ms 0 KB -