Submission #183854

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

boxes

/*
░░░░██████████████████
░░▄███████▀▀▀▀▀▀███████▄
░▐████▀▒mohammad▒▀██████▄
░███▀▒▒▒▒alaa▒▒▒▒▒▒▀█████
░▐██▒▒▒alwrawrah▒▒▒▒▒████▌
░▐█▌▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒████▌
░░█▒▄▀▀▀▀▀▄▒▒▄▀▀▀▀▀▄▒▐███▌
░░░▐░░░▄▄░░▌▐░░░▄▄░░▌▐███▌
░▄▀▌░░░▀▀░░▌▐░░░▀▀░░▌▒▀▒█▌
░▌▒▀▄░░░░▄▀▒▒▀▄░░░▄▀▒▒▄▀▒▌
░▀▄▐▒▀▀▀▀▒▒▒▒▒▒▀▀▀▒▒▒▒▒▒█
░░░▀▌▒▄██▄▄▄▄████▄▒▒▒▒█▀
░░░░▄██████████████▒▒▐▌
░░░▀███▀▀████▀█████▀▒▌
░░░░░▌▒▒▒▄▒▒▒▄▒▒▒▒▒▒▐
░░░░░▌▒▒▒▒▀▀▀▒▒▒▒▒▒▒▐
*/
 
#include<bits/stdc++.h>
#include "boxes.h"
using namespace std;
 
typedef long long ll ;
const ll oo = 1e13 ;
const double PI = acos(-1) ;
const ll M = 1e9 + 7  ;

ll dp[10000001] , a[10000001] , ans = 1e18;

ll delivery(int N, int K, int L, int p[]){
	for(int i = 0 ; i < N ; ++i){
		if(i + 1 >= K) dp[i] = p[i] * 2 + (i + 1 == K ? 0 : dp[i - K]);
		else dp[i] = p[i] * 2;
	}
	for(int i = N - 1; i >= 0 ; --i){
		if(N - i >= K) a[i] = (L - p[i]) * 2 + a[i + K];
		else a[i] = p[i] * 2;
	}
	for(int i = 0 ; i < N - 1 ; ++i) ans = min(dp[i] + a[i + 1] , ans);
	return min(ans , min(dp[N - 1] , a[0]));
}

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