Submission #73736

#	Time	Username	Problem	Language	Result	Execution time	Memory
73736		aleksam	Boxes with souvenirs (IOI15_boxes)	C++14	10 / 100	6 ms	604 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
#define MAX_N 10000000
using namespace std;
long long r[MAX_N], l[MAX_N];
int p[MAX_N];
long long N, K, L;
void compute_l(){//l[i]=cena koju moram da platim ako hocu da snabdem sve do i-tog direktno
	for(int i=0; i<N; ++i){
		if(i%K!=0)l[i]=l[i-1]-p[i-1]+p[i];
		else l[i]=l[i-1]+p[i];
	}
	for(int i=0; i<N; ++i){
		l[i]*=2;
	}
}
void compute_r(){
	for(int i=N-1; i>=0; --i){//r[i]=cena za koju mogu da garantujem da pokrivam sve od i do N-1
		if((N-1-i)%K!=0)r[i]=r[i+1]+(L-p[i])-(L-p[i+1]);
		else r[i]=r[i+1]+L-p[i];
	}
	for(int i=0; i<N; ++i){
		r[i]*=2;
	}
}
long long delivery(int n, int k, int li, int P[]) {
	N=n;K=k;L=li;
	int nula=0;
	while(nula<N && P[nula]==0)nula++;
	N-=nula;
	for(int i=0; i<N; ++i)p[i]=P[i+nula];
	compute_l();
	compute_r();
	//for(int i=0; i<N; ++i)printf("l[%d]=%d\n", i, l[i]);
	//for(int i=0; i<N; ++i)printf("r[%d]=%d\n", i, r[i]);
	long long min=(long long)r[0];
	if(r[0]<min)min=r[0];//Ako idemo skroz s iste strane
	if(l[N-1]<min)min=l[N-1];
	for(int i=0; i<N-1; ++i){
		//Od 0...i radi l, a i+1...N-1 uzima r
		if(l[i]+r[i+1]<min)min=l[i]+r[i+1];
	}
	for(int i=0; i+k+1<N; ++i){
		//0...i radi l, i+k+1...N-1 radi r
		if(l[i]+r[i+k+1]+L<min)min=l[i]+r[i+k+1]+L;
	}
	if(r[k]+L<min){min=r[k]+L;assert(0);}
	if(l[N-k-1]+L<min){min=l[N-k-1]+L;for(;;);}
	/*if(N>2*k){
		for(int i=0; i+2*k+1<N; ++i){
			//0...i radi l, i+k+1...N-1 radi r
			if(l[i]+r[i+2*k+1]+2*L<min)min=l[i]+r[i+2*k+1]+2*L;
		}
		if(r[2*k]+2*L<min)min=r[2*k]+2*L;
		if(l[N-2*k-1]+2*L<min)min=l[N-2*k-1]+2*L;
	}*/
	return min;
}

Compilation message (stderr)

boxes.cpp: In function 'void compute_r()':
boxes.cpp:18:13: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  for(int i=N-1; i>=0; --i){//r[i]=cena za koju mogu da garantujem da pokrivam sve od i do N-1
            ~^~

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