oj.uz

Submission #65206

# Submission time Handle Problem Language Result Execution time Memory
65206 2018-08-07T04:38:08 Z daniel_02 Boxes with souvenirs (IOI15_boxes) C++17
50 / 100
 2000 ms 4284 KB 
#include "boxes.h"
#include <bits/stdc++.h>

using namespace std;

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

    long long ans = 0;

    if (K == 1)
    {
        for (int i = 0; i < N; i++)
        {
            if (p[i] <= L / 2)
            {
                ans += (p[i] * 2LL);
            }
            else
            {
                ans += ((L - p[i]) * 2LL);
            }
        }
    }
    else if (K == N)
    {
        bool l = 0, r = 0;

        for (int i = 0; i < N; i++)
        {
            if (p[i] <= L / 2)
            {
                l = 1;
            }
            else
            {
                r = 1;
            }
        }

        if (l == 1 && r == 0)
        {
            return (p[N - 1] * 2);
        }
        else if (r == 1 && l == 0)
        {
            return ((L - p[0]) * 2);
        }

        ans = L;

        long long cur = 0;

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

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

        ans = min(ans, cur);

    }
    else
    {
        ans = 1LL * 1e18 + 7;

        for (int i = 0; i < N; i++)
        {
            long long cur = 0;

            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 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct

Subtask #2
10.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 Correct 2 ms 252 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct

Subtask #3
15.0 / 15.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 Correct 17 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 252 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 17 ms 376 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 2 ms 380 KB Output is correct
28 Correct 2 ms 256 KB Output is correct
29 Correct 2 ms 256 KB Output is correct
30 Correct 2 ms 252 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 256 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 252 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 17 ms 376 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 2 ms 380 KB Output is correct
28 Correct 2 ms 256 KB Output is correct
29 Correct 2 ms 256 KB Output is correct
30 Correct 2 ms 252 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Correct 550 ms 4284 KB Output is correct
34 Correct 1354 ms 4284 KB Output is correct
35 Execution timed out 2060 ms 4216 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 252 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 17 ms 376 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 2 ms 380 KB Output is correct
28 Correct 2 ms 256 KB Output is correct
29 Correct 2 ms 256 KB Output is correct
30 Correct 2 ms 252 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Correct 550 ms 4284 KB Output is correct
34 Correct 1354 ms 4284 KB Output is correct
35 Execution timed out 2060 ms 4216 KB Time limit exceeded
36 Halted 0 ms 0 KB -