Submission #1081913

#	Time	Username	Problem	Language	Result	Execution time	Memory
1081913		raphael_heuchl	Boxes with souvenirs (IOI15_boxes)	C++14	0 / 100	12 ms	8540 KiB

boxes

#include "boxes.h"
#include <vector>
#include <algorithm>
#include <map>
#include <iostream>
#define INF 1'000'000'000

std::vector<int> people;
int n, l, k;
int dist(int curr)
{
    return std::min(l - people[curr], people[curr]);
}

int dp[1000][1000];
long long f(int curr, int pres) //pres + 1 gifts left at person curr
{
    if (dp[curr][pres])
        return dp[curr][pres];

    if (curr == n)
        return dp[curr][pres] = dist(curr);

    long long optionA = pres ? std::abs(people[curr] - people[curr+1]) + f(curr + 1, pres - 1) : INF;
    long long optionB = dist(curr) + dist(curr + 1) + f(curr + 1, k-1);
    return dp[curr][pres] = std::min(optionA, optionB);
}

long long delivery(int N, int K, int L, int p[])
{
    n = N, k = K, l = L;
    people.push_back(0);
    for (int i = 0; i < N; ++i)
        people.push_back(p[i]);
    std::sort(people.begin(), people.end());
    return f(0, K - 1);
}

Compilation message (stderr)

boxes.cpp: In function 'long long int f(int, int)':
boxes.cpp:26:37: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   26 |     return dp[curr][pres] = std::min(optionA, optionB);
      |                             ~~~~~~~~^~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30