제출 #240948

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

boxes

#include "boxes.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx2")
 
#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 m,b[li],flag,t,b1[li];
lo cev;
string s;
multiset<lo> st,st1;
 
long long delivery(int n, int k, int l, int a[]) {
	for(int i=0;i<n;i++){
		if(i<k)b[i]=a[i]*2;
		else b[i]=a[i]*2+b[i-k];
	}
	for(int i=n-1;i>=0;i--){
		if(n-i-1<k)b1[i]=(l-a[i])*2;
		else b1[i]=(l-a[i])*2+b1[i+k];
		cev+=b1[i];
	}
	cev=b1[0];
	lo mn=cev;
	for(int i=0;i<n;i++){
		//~ cout<<b1[i]<<endl;
		cev-=b1[i];
		if(i+1<n)cev+=b1[i+1];
		cev+=b[i];
		if(i-1>=0)cev-=b[i-1];
		//~ cout<<cev<<endl;
		mn=min(mn,cev);
	}
    return mn;
}

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