제출 #284356

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
284356		AKaan37	선물상자 (IOI15_boxes)	C++17	20 / 100	6 ms	512 KiB

boxes

//Bismillahirrahmanirrahim

 #include "boxes.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t;
lo cev;
vector<lo> v,vv;

long long delivery(int N, int K, int L, int p[]) {
	//~ cout<<"**\n";
	for(int i=0;i<N;i++){
		if(p[i]==0)continue;
		if(p[i]<=(L-p[i]))v.pb(p[i]);
		else vv.pb(p[i]);
	}
	n=N;
	k=K;
	lo mn=inf;
	sort(v.begin(),v.end());
	sort(vv.begin(),vv.end());
	reverse(vv.begin(),vv.end());
	if((int)v.size()==0 && (int)vv.size()==0)return 0;
	if((int)v.size()==0){
		lo cev1=0;
		for(int j=0;j<(int)vv.size();j++){
			cev1+=(L-vv[j])*2;
			if(j%K!=K-1)cev1-=(L-vv[j])*2;
		}
		return cev1;
	}
	if((int)vv.size()==0){
		lo cev1=0;
		for(int j=0;j<(int)v.size();j++){
			cev1+=(v[j])*2;
			if(j%K!=K-1)cev1-=(v[j])*2;
		}
		return cev1;
	}
	cev=0;
	for(int i=0;i<(int)v.size();i++){
		cev+=v[i]*2;
		lo cev1=cev;
		//~ cout<<cev1<<" :  : ";
		for(int j=0;j<(int)vv.size();j++){
			cev1+=(L-vv[j])*2;
			//~ if(j==(int)vv.size()-1)printf("%lld\n",cev1);
			//~ cout<<vv.size()<<endk
			mn=min(mn,cev1+((lo)vv.size()-j-1+((lo)v.size()-i-1)+K-1)/K*L);
			mn=min(mn,cev1+((lo)vv.size()-j-1+((lo)v.size())+K-1)/K*L);
			if(j%K!=K-1)cev1-=(L-vv[j])*2;
		}
		mn=min(mn,cev+((lo)vv.size()+((lo)v.size()-i-1)+K-1)/K*L);
		if(i%K!=K-1)cev-=v[i]*2;
	}
	mn=min(mn,((lo)vv.size()+((lo)v.size())+K-1)/K*L);
	if(mn==inf)mn=0;
    return mn;
}

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