Submission #954725

#	Time	Username	Problem	Language	Result	Execution time	Memory
954725		SmuggingSpun	Boxes with souvenirs (IOI15_boxes)	C++14	20 / 100	1 ms	348 KiB

boxes

#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>void minimize(T& a, T b){
	if(a > b){
		a = b;
	}
}
ll delivery(int n, int k, int l, int p[]){
	assert(n <= 1000);
	if(k == 1){
		ll ans = 0;
		for(int i = 0; i < n; i++){
			ans += min(p[i], l - p[i]) << 1;
		}
		return ans;
	}
	else if(k == n){
		ll ans = min(l, min(l - p[0], p[n - 1]) << 1);
		for(int i = 0; i < n - 1; i++){
			minimize(ans, ll(p[i] + l - p[i + 1]) << 1LL);
		}
		return ans;
	}
	assert(false);
}

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