제출 #60728

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
60728		Eae02	선물상자 (IOI15_boxes)	C++14	0 / 100	2 ms	376 KiB

boxes

#include "boxes.h"

#include <bits/stdc++.h>

long long delivery(int numTeams, int capacity, int numSections, int p[])
{
	std::vector<int64_t> timeL(numTeams);
	std::vector<int64_t> timeR(numTeams);
	
	for (int i = 0; i < numTeams; i++)
	{
		timeL[i] = std::min(p[i] * 2, numSections);
		timeR[i] = std::min((numSections - p[i]) * 2, numSections);
	}
	
	for (int i = capacity + 1; i < numTeams; i++)
	{
		timeL[i] += timeL[i - capacity];
		int ri = numTeams - i - 1;
		timeR[ri] += timeR[ri + capacity];
	}
	
	int64_t t = INT64_MAX;
	for (int i = 0; i < numTeams; i++)
	{
		t = std::min(t, timeL[i] + timeR[i]);
	}
	
	return t;
}

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