Submission #128194

#	Time	Username	Problem	Language	Result	Execution time	Memory
128194		zeyad49	Boxes with souvenirs (IOI15_boxes)	C++17	0 / 100	6 ms	4216 KiB

boxes

#include <bits/stdc++.h>
using namespace std;
const int N=1000;
const long long INF=(long)1e18;
int K,L;
int memo[N][N];
int teams[N];
long long dist[N][N];
long long dp(int l,int r) {
		if(l>r)
			return 0;
		if(memo[l][r]!=-1)
		return memo[l][r];
		long long ans=INF;
		int last;
		last=max(r, l+K-1);
		ans=dp(last+1,r)+2*teams[last];
		last=min(l, r-K+1);
		ans=min(ans, dp(l,last-1)+2*(L-teams[last]));
		return memo[l][r]=ans;
	}
	long long delivery(int a, int b, int c, int x[]) {
		K=b;
		long long ans=0;
		L=c;
		sort(x,x+a);
		for(int i=0;i<a;i++){
		    teams[i]=x[i];
		    ans+=min(x[i],L-x[i]);
		    
		    for(int j=0;j<a;j++)
		        memo[i][j]=-1;
		}
		ans=x[a-1]+min(L-x[a-1],x[a-1]);
		ans=min(ans,0LL+L-x[0]+min(x[0],L-x[0]));
		return ans;
	}

	
	

    

Compilation message (stderr)

boxes.cpp: In function 'long long int dp(int, int)':
boxes.cpp:20:21: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
   return memo[l][r]=ans;
                     ^~~

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