Submission #404725

#	Time	Username	Problem	Language	Result	Execution time	Memory
404725		Dakto	Boxes with souvenirs (IOI15_boxes)	C++17	0 / 100	7 ms	300 KiB

boxes

#include <bits/stdc++.h>
using namespace std;


int delivery(int n, int k, int l, int V[]){
    vector<int> v(V, V+n);
    v.erase(v.begin(),lower_bound(v.begin(),v.end(),1));
    n=v.size();
    vector<int> ps, ps2(n);
    int c=0;
    for(int i=0; i<n; i++){
        ps.push_back(min(2*v[i], l)+c);
        if((i-1)%k==0){
            c+=min(2*v[i],l);
        }
    }

    c=0;
    int j=0;
    for(int i=n-1; i>=0; i--,j++){
        ps2[i]=min(2*(l-v[i]), l)+c;
        if((j-1)%k==0){
            c+=min(2*(l-v[i]),l);
        }
    }

    int res=min(ps[n-1],ps2[0]);
    for(int i=0; i<n; i++) cerr<<ps[i]<<" "<<ps2[i]<<endl;
    for(int i=0; i<n-1; i++) res=min(res,ps[i]+ps2[i+1]);
    for(int i=0; i<n-k; i++) res=min(res,ps[i]+ps2[i+k]+l);
    return res;
}

Compilation message (stderr)

boxes.cpp: In function 'int delivery(int, int, int, int*)':
boxes.cpp:8:13: warning: conversion from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
    8 |     n=v.size();
      |       ~~~~~~^~

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