Submission #420164

#	Time	Username	Problem	Language	Result	Execution time	Memory
420164		dxz05	선물상자 (IOI15_boxes)	C++14	10 / 100	1 ms	256 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>

typedef long long ll;

using namespace std;

const int MAXN = 1111111;

int dp[MAXN];

long long delivery(int N, int K, int L, int p[]) {
    vector<int> v, lf, rg;
    for (int i = 0; i < N; i++){
        if (p[i] == 0) continue;
        v.push_back(p[i]);
        if (p[i] <= L / 2) lf.push_back(p[i]); else
            rg.push_back(p[i]);
    }
    N = v.size();

    ll cost = 0, prizes = K;
    for (int i = rg.size() - 1; i >= 0; i--){
        if (prizes){
            prizes--;
            cost += (i < rg.size() - 1 ? rg[i + 1] : L) - rg[i];
            dp[i] = cost;
        } else {
            prizes = K - 1;
            cost += L - rg[i + 1] + L - rg[i];
            dp[i] = cost;
        }
        dp[i] += L - rg[i];
       // cout << dp[i] << ' ';
    }

    cost = 0, prizes = K;
    for (int i = 0; i < lf.size(); i++){
        if (prizes){
            prizes--;
            cost += lf[i] - (i > 0 ? lf[i - 1] : 0);
        } else {
            prizes = K - 1;
            cost += lf[i] + lf[i - 1];
        }
    }


    ll ans = 1e18;

    if (lf.empty()) ans = dp[0]; else
        ans = cost + lf.back() + dp[0];

    if (prizes > 0 && !lf.empty()){
        if (prizes >= rg.size()){
            ans = min(ans, cost + L - lf.back());
        } else {
            ans = min(ans, cost + L - lf.back() + dp[prizes]);
        }
    }

    return ans;
}

Compilation message (stderr)

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:20:15: warning: conversion from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   20 |     N = v.size();
      |         ~~~~~~^~
boxes.cpp:23:28: warning: conversion from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   23 |     for (int i = rg.size() - 1; i >= 0; i--){
      |                  ~~~~~~~~~~^~~
boxes.cpp:26:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |             cost += (i < rg.size() - 1 ? rg[i + 1] : L) - rg[i];
      |                      ~~^~~~~~~~~~~~~~~
boxes.cpp:27:21: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   27 |             dp[i] = cost;
      |                     ^~~~
boxes.cpp:31:21: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   31 |             dp[i] = cost;
      |                     ^~~~
boxes.cpp:38:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     for (int i = 0; i < lf.size(); i++){
      |                     ~~^~~~~~~~~~~
boxes.cpp:55:20: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |         if (prizes >= rg.size()){
      |             ~~~~~~~^~~~~~~~~~~~

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