oj.uz

Submission #63907

# Submission time Handle Problem Language Result Execution time Memory
63907 2018-08-03T06:47:45 Z Kubalionzzale Boxes with souvenirs (IOI15_boxes) C++14
20 / 100
 2 ms 420 KB 
#include "boxes.h"
#include <map>
#include <iostream>
#include <algorithm>

long long delivery(int n, int k, int l, int p[]) {

    if (n == 1)
    {
        return std::min(p[0] * 2LL, (l - p[0]) * 2LL);
    }

    int here = n;
    for (int i = 0; i < n; ++i)
    {
        if (p[i] > l - p[i] && here == n)
        {
            here = i;
        }
        if (i >= here)
        {
            p[i] = l - p[i];
        }
    }

    if (here == 0)
    {
        int cur = k - 1;
        long long int sum = p[n - 1];
        for (int i = n - 2; i >= 0; --i)
        {
            if (cur == 0)
            {
                sum += p[i + 1] * 2LL + p[i] - p[i + 1];
                cur = k - 1;
            }
            else
            {
                sum += p[i] - p[i + 1] * 1LL;
                --cur;
            }
        }

        return sum + p[0] * 1LL;
    }
    else if (here == n)
    {
        int cur = k - 1;
        long long int sum = p[0];
        for (int i = 1; i < n; ++i)
        {
            if (cur == 0)
            {
                sum += p[i - 1] * 2LL + p[i] - p[i - 1];
                cur = k - 1;
            }
            else
            {
                sum += p[i] - p[i - 1] * 1LL;
                --cur;
            }
        }

        return sum + p[n - 1] * 1LL;
    }

    long long int sumleft = p[here - 1], leftleft = -1;
    int cur = k - 1;

    for (int i = here - 2; i >= 0; --i)
    {
        if (cur == 0)
        {
            sumleft += p[i + 1] + p[i] * 1LL;
            cur = k - 1;
        }
        else
        {
            sumleft += p[i + 1] - p[i] * 1LL;
            --cur;
        }
    }

    sumleft += p[0];

    long long int sumright = p[here], leftright = -1;
    cur = k - 1;

    for (int i = here + 1; i < n; ++i)
    {
        if (cur == 0)
        {
            sumright += p[i - 1] + p[i] * 1LL;
            cur = k - 1;
        }
        else
        {
            sumright += p[i - 1] - p[i] * 1LL;
            --cur;
        }
    }

    sumright += p[n - 1];
    leftright = cur;

    long long int curmin = sumleft + sumright;

    if (k == 1)
        return curmin;

    long long int curval, max = 0;
    int where = std::max(here - k + 1, 0);
    for (int i = std::max(here - k + 1, 0);; ++i)
    {
        if (i >= here)
            break;
        if (i + k - 1 >= n)
            break;

        curval = 0;
        if (i - 1 > 0)
        {
            curval += p[i] - p[i - 1] * 1LL;
        }
        else
        {
            curval += p[i] * 1LL;
        }

        if (i + k < n)
        {
            if (i + k == here)
            {
                curval += (l - p[i + k]) * 1LL - p[i + k - 1];
            }
            else
            {
                curval += p[i + k - 1] - p[i + k] * 1LL;
            }
        }
        else
        {
            curval += p[i + k - 1] * 1LL;
        }

        if (curval > max)
        {
            max = curval;
            where = i;
        }
    }

    long long int cursum = l;
    if (where != 0)
    {
        cur = k - 1;
        cursum += p[where - 1];

        for (int i = where - 2; i >= 0; --i)
        {
            if (cur == 0)
            {
                cursum += p[i + 1] + p[i] * 1LL;
                cur = k - 1;
            }
            else
            {
                cursum += p[i + 1] - p[i] * 1LL;
                --cur;
            }
        }

        cursum += p[0];
    }

    if (where + k - 1 != n - 1)
    {
        cur = k - 1;
        cursum += p[where + k];

        for (int i = where + k + 1; i < n; ++i)
        {
            if (cur == 0)
            {
                cursum += p[i - 1] + p[i] * 1LL;
                cur = k - 1;
            }
            else
            {
                cursum += p[i - 1] - p[i] * 1LL;
                --cur;
            }
        }

        cursum += p[n - 1];
    }

    return std::min(curmin, cursum);
}

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:67:42: warning: unused variable 'leftleft' [-Wunused-variable]
     long long int sumleft = p[here - 1], leftleft = -1;
                                          ^~~~~~~~
boxes.cpp:86:39: warning: variable 'leftright' set but not used [-Wunused-but-set-variable]
     long long int sumright = p[here], leftright = -1;
                                       ^~~~~~~~~

Subtask #1
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 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 420 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 376 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 376 KB Output is correct
7 Correct 2 ms 292 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 252 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Incorrect 2 ms 376 KB Output isn't correct
8 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 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 420 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 376 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 292 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 252 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Incorrect 2 ms 376 KB Output isn't correct
22 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 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 420 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 376 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 292 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 252 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Incorrect 2 ms 376 KB Output isn't correct
22 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 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 420 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 376 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 292 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 252 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Incorrect 2 ms 376 KB Output isn't correct
22 Halted 0 ms 0 KB -