Submission #240717

#	Time	Username	Problem	Language	Result	Execution time	Memory
240717		tleontest1	Boxes with souvenirs (IOI15_boxes)	C++14	10 / 100	5 ms	436 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;
lo cev;
string s;
vector<int> v;
 
long long delivery(int n, int k, int l, int a[]) {
	for(int i=0;i<n;i++){
		cev+=min(l-a[i],a[i])*2;
	}
	if(k==1)return cev;
	cev=inf;
	lo kat=0;
	for(int j=n-1;j>=0;j-=k)kat+=a[j]*2;
	cev=min(cev,kat);
	kat=0;
	for(int j=0;j<n;j+=k)kat+=(l-a[j])*2;
	cev=min(cev,kat);
	for(int i=0;i<n-1;i++){
		lo at=0;
		for(int j=i;j>=0;j-=k)at+=a[j]*2;
		for(int j=i+1;j<n;j+=k)at+=(l-a[j])*2;
		cev=min(cev,at);
	}
    return cev;
}

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