제출 #897900

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
897900		ByeWorld	선물상자 (IOI15_boxes)	C++14	50 / 100	2016 ms	18260 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
using namespace std;
typedef pair<ll,ll> pii;
const ll MAXN = 1e7+10;
const ll INF = 2e18+10;

int n, k, l;
int a[MAXN];
ll ans = INF;

long long delivery(int N, int K, int L, int p[]) {
    n = N; k = K; l = L; 
    for(int i=0; i<n; i++) a[i+1] = p[i];
    //cout << n << ' ' << k << ' ' << a[1] << " p\n";

    ll nw = 0;
	for(int i=0; i<=n; i++){ // paling terakhirnya ada di i 
		nw = 0;
		for(int j=i; j>=1; j-=k){
			if(a[j] <= l/2) nw += 2*a[j];
			else nw += l;
		}
		for(int j=i+1; j<=n; j+=k){
			if(a[j] <= l/2) nw += l;
			else nw += 2*(l-a[j]);

		}
		ans = min(ans, nw);
	}
	return ans;
}

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