Submission #813150

#	Time	Username	Problem	Language	Result	Execution time	Memory
813150		OrazB	Boxes with souvenirs (IOI15_boxes)	C++14	10 / 100	1 ms	308 KiB

boxes

#include <bits/stdc++.h>
// #include "boxes.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second

// const int N = 1e5+5;

ll delivery(int n, int K, int L, int p[]){
	if (K == 1){
		ll sum = 0;
		for (int i = 0; i < n; i++){
			sum += min(p[i], L-p[i])*2;
		}
		return sum;
	}
	int j = -1;
	for (int i = 0; i < n; i++){
		if (L-p[i] >= p[i]) j = i;
	}
	if (j == -1 or j == n-1) return n;
	ll a = p[j]*2, b = (L-p[j+1])*2;
	return min(n*1LL, a+b);
}


// int main ()
// {
// 	ios::sync_with_stdio(false);
// 	cin.tie(0);
// 	cin >> t;
// 	while (t--){
			
// 	}
// }

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