Submission #364050

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

boxes

#include "boxes.h"

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <climits>
#include <cstring>

using namespace std;

using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using ii = pair<int,int>;
using vii = vector<pair<int,int>>;
using vb = vector<bool>;
template<typename T>
using Graph = vector<vector<T>>;

ll delivery(int n, int K, int L, int p[])
{
	ll ans = 0;
	if(K == 1) 
	{
		for(int i = 0; i < n; ++i)
		{
			ans += 2LL * min(p[i], L - p[i]);
		}
	} else if(K == n)
	{
		ans = min(1LL * L, 2LL * p[n - 1]);
		ans = min(ans, 2LL * (L - p[0]));
		for(int i = 0; i < n - 1; ++i)
		{
			ans = min(ans, 2LL * p[i] + 2LL * (L - p[i + 1]));
		}
	}
	return ans;
}

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