oj.uz

Submission #65328

# Submission time Handle Problem Language Result Execution time Memory
65328 2018-08-07T11:41:33 Z daniel_02 Boxes with souvenirs (IOI15_boxes) C++17
10 / 100
 4 ms 380 KB 
#include "boxes.h"
#include <bits/stdc++.h>

#define ll long long

using namespace std;

long long delivery(int N, int K, int L, int p[]) {

    long long ans;

    ans = 1LL * 1e18 + 7;

    ll cur = 0;

    for (int i = 0; i < N; i++)
    {
        for (int j = i; j >= 0; j -= K)
        {
            if (p[j] <= L / 2)
                cur += (p[j] * 2);
            else
            {
                if (j - K + 1 >= 0)
                {
                    cur += min((L - p[j - K + 1]) * 2, L);
                }
                else
                {
                    if (p[0] > L / 2)
                        cur += min((L - p[0]) * 2, L);
                    else
                        cur += L;
                }
            }
        }

        for (int j = i + 1; j < N; j += K)
        {
            if (p[j] > L / 2)
            {
                cur += ((L - p[j]) * 2);
            }
            else
            {
                if (j + K - 1 < N)
                {
                    cur += min(p[j + K - 1] * 2, L);
                }
                else
                {
                    if (p[N - 1] <= L / 2)
                        cur += min(p[N - 1] * 2, L);
                    else
                        cur += L;
                }
            }
        }
        ans = min(ans, cur);
    }


    return ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 256 KB Output is correct
3 Correct 3 ms 256 KB Output is correct
4 Correct 3 ms 292 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 380 KB Output is correct
7 Correct 4 ms 376 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 256 KB Output is correct
3 Correct 3 ms 256 KB Output is correct
4 Correct 3 ms 292 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 380 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Incorrect 2 ms 256 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 256 KB Output is correct
3 Correct 3 ms 256 KB Output is correct
4 Correct 3 ms 292 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 380 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Incorrect 2 ms 256 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 256 KB Output is correct
3 Correct 3 ms 256 KB Output is correct
4 Correct 3 ms 292 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 380 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Incorrect 2 ms 256 KB Output isn't correct
11 Halted 0 ms 0 KB -