Submission #996506

#TimeUsernameProblemLanguageResultExecution timeMemory
996506AlfraganusBoxes with souvenirs (IOI15_boxes)C++17
10 / 100
0 ms348 KiB
#include <bits/stdc++.h>
#include "boxes.h"
using namespace std;

#define ll long long

ll delivery(int n, int k, int l, int p[]) {
    sort(p, p + n);
    ll ans = 1e18;
    vector<int> q;
    for(int i = 0; i < n; i ++)
        if(p[i] != 0)
            q.push_back(p[i]);
    n = q.size();
    vector<ll> pref(n + 1), suff(n + 1);
    for(int i = 0; i < n; i ++)
        pref[i + 1] = (i + 1 < k ? 0 : pref[i + 1 - k]) + q[i] * 2;
    for(int i = n - 1; i >= 0; i --)
        suff[i] = (i + k > n ? 0 : suff[i + k]) + 2 * l - 2 * q[i];
    for(int i = 0; i <= n; i ++)
        ans = min(ans, pref[i] + suff[i]);
    return ans;
}

Compilation message (stderr)

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:14:15: warning: conversion from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   14 |     n = q.size();
      |         ~~~~~~^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...