제출 #490748

#제출 시각아이디문제언어결과실행 시간메모리
490748PoPularPlusPlusBoxes with souvenirs (IOI15_boxes)C++17
100 / 100
637 ms215516 KiB
#include <bits/stdc++.h>
#include "boxes.h"
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long  ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define MXL 1000000000000000000
#define PI (ld)2*acos(0.0)
#define nax 200005
#define pb push_back
#define sc second
#define fr first
//#define int unsigned long long
//#define endl '\n'
#define ld long double
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
 
long long delivery(int n, int k, int l, int a[])
{
	vector<ll> cw(n+2, MXL);
	vector<ll> ccw(n+2, MXL);
	sort(a, a+n);
	cw[0] = 0;
	for(int i = 1; i <= n; i++)
	{
		cw[i] = cw[max(0, i-k)] + 2*a[i-1];
	}
	ccw[n+1] = 0;
	for(int i = n; i >= 1; i--)
	{
		ccw[i] = ccw[min(n+1, i+k)] + 2 * (l-a[i-1]);
	}
	ll ans = MXL;
	for(int i = 0; i <= n; i++)
	{
		ans = min(ans, cw[i] + ccw[i+1]);
		ans = min(ans, cw[i] + ccw[min(n+1, i+1+k)] + l);
	}
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...