Submission #1122980

#	Time	Username	Problem	Language	Result	Execution time	Memory
1122980		heey	Boxes with souvenirs (IOI15_boxes)	C++17	0 / 100	0 ms	324 KiB

boxes

#include<bits/stdc++.h>
#define f first
#define s second
#define all(x) (x).begin(), (x).end()
#define mod 1'000'000'007
#define inf 1'000'000'000'000'00
#define pb push_back
#define vvi vector<vi>
#define fst ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;



long long delivery(int n, int k, int L, int a[]){
	int res = INT_MAX;
	vector<int> dpc(n+1), dpcc(n+1);
	for(int i = 1; i <= n; i++){
		if(i >= k) dpc[i] = dpc[i-k];
		dpc[i] += 2*a[i-1];
	}

	for(int i = n-1; i >= 0; i--){
		if(i < n-k) dpcc[i] = dpcc[i+k];
		dpcc[i] += 2*(L - a[i]);
	}

	
	for(int i = 0; i <= n; i++){
 		res = min(res, dpc[i] + dpcc[i]);
	}
	return res;
}

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