Submission #1224038

#	Time	Username	Problem	Language	Result	Execution time	Memory
1224038		moondarkside	Boxes with souvenirs (IOI15_boxes)	C++20	0 / 100	0 ms	328 KiB

boxes

#include<bits/stdc++.h>
using namespace std;


long long getCost(vector<long long>& Arr,int SubT,int k){
	long long cost=0;
	for(int i=Arr.size()-1-SubT;i>-1;i-=k){
		cost+=Arr[i]*2LL;
	}
	return cost;
}

long long delivery(int N,int K, int L, int* Pos){
	vector<long long> CostR;
	vector<long long> CostL;

	for(int i=0;i<N && Pos[i]<=L/2;i++){
		if(i<K){
			CostR.push_back(Pos[i]*2);
		}
		else {
			CostR.push_back(Pos[i-K]*2);
		}
	}
	for(int i=N-1;i>-1 && Pos[i]>L/2;i--){
		if(i>N-K-1){
			CostL.push_back((L-Pos[i])*2);
		}
		else {
			CostL.push_back((L-Pos[i+K])*2);
		}
	}
	
	
	long long minC=1000000000000;
	for(int loopS=0;loopS<=K;loopS++){
		int loopSR=K-loopS;
		long long cost=0;
		if((int)CostR.size()<loopSR){
			cost=1000000000000;
		}
		else if((int)CostL.size()<loopS){
			cost=1000000000000;
		}
		else{
			cost=CostR[CostR.size()-loopSR]+CostL[CostL.size()-loopS]+L;
		}
		if(cost<minC){
			minC=cost;
		}
	}
	return min(getCost(CostR,0,K)+getCost(CostL,0,K),minC);

}

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