제출 #127252

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
127252		ekrem	선물상자 (IOI15_boxes)	C++98	10 / 100	5 ms	504 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define sol (k+k)
#define sag (k+k+1)
#define orta ((bas+son)/2)
#define coc g[node][i]
#define mod 1000000007
#define inf 1000000009
#define N 1000005
using namespace std;

typedef long long ll;
typedef pair < int , int > ii;

ll cvp, bas[N], son[N];

ll delivery(int n, int k, int l, int p[]) {
	for(int i = 0; i < n; i++)
		bas[i] = (i >= k) ? bas[i - k] + p[i]*2 : p[i]*2;
	for(int i = n - 1; i >= 0; i--)
		son[i] = (n - i > k) ? son[i + k] + (l - p[i])*2 : (l - p[i])*2;
	cvp = son[0];
	for(int i = -1; i < n; i++)
		for(int j = i + 1; j <= n; j++)
			cvp = min(cvp, ((i>=0)?bas[i]:0) + son[j] + (j - i - 1 + k - 1)/k*l);
    return cvp;
}

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