제출 #283522

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
283522		FlashGamezzz	선물상자 (IOI15_boxes)	C++14	100 / 100	575 ms	164084 KiB

boxes

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <string>
#include <utility>
#include <vector>
#include "boxes.h"

using namespace std;

long teams[10000000];
long long delivery(int N, int K, int L, int p[]) {
	long n = N, k = K, len = L;
	long long ans = 1000000000000000000;
    for (long i = 0; i < n; i++){
    	teams[i] = p[i];
    }
	for (long i = 0; i < k && i < n; i++){
		long long t = min(len, min(2*teams[i], 2*(len-teams[0])));
		long l = i+1, r = i+k;
		while (true){
			if (r >= n){
				if (l < n){
					r = n-1;
					t += min(len, min(2*teams[r], 2*(len-teams[l])));
				}
				break;
			}
			t += min(len, min(2*teams[r], 2*(len-teams[l])));
			l += k;
			r += k;
		}
		ans = min(ans, t);
	}
	return ans;
}

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