Submission #197328

#	Time	Username	Problem	Language	Result	Execution time	Memory
197328		Juney	Boxes with souvenirs (IOI15_boxes)	C++14	100 / 100	622 ms	293424 KiB

boxes

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

typedef long long ll;

const int MAXN = 1e7 + 5;

ll N, K, L;
ll dp1[MAXN], dp2[MAXN], ans;

ll delivery(int _N, int _K, int _L, int p[]) {
	N = _N; K = _K; L = _L;
	for(int i=0; i<N; i++) {
		if(i >= K) dp1[i] = dp1[i-K];
		dp1[i] += min(L, 2LL * p[i]);
	}
	for(int i=N-1; i>=0; i--) {
		if(i+K < N) dp2[i] = dp2[i+K];
		dp2[i] += min(L, 2LL * (L - p[i]));
	}
	ans = min(dp1[N-1], dp2[0]);
	for(int i=0; i<N-1; i++) ans = min(ans, dp1[i] + dp2[i+1]);
	return ans;
}

Compilation message (stderr)

boxes.cpp: In function 'll delivery(int, int, int, int*)':
boxes.cpp:18:13: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
  for(int i=N-1; i>=0; i--) {
            ~^~

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