Submission #128296

#	Time	Username	Problem	Language	Result	Execution time	Memory
128296		zeyad49	Boxes with souvenirs (IOI15_boxes)	C++17	10 / 100	1768 ms	4444 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;
		if(r-l+1<=K)
          ans=L;
		for(int k=l;k<=r;k++){
          if(k-l+1>K) break;
		    ans=min(ans,teams[k]+dp(k+1,r)+min(teams[k],L-teams[k]));
		}
		for(int k=r;k>=l;k--){
          if(r-k+1>K)
            break;
		    ans=min(ans,L-teams[k]+dp(l,k-1)+min(L-teams[k],teams[k]));
		}
		return memo[l][r]=ans;
	}
	long long delivery(int a, int b, int c, int x[]) {
		K=b;
		L=c;
		sort(x,x+a);
		for(int i=0;i<a;i++){
		    teams[i]=x[i];
        for(int j=0;j<a;j++)
		        memo[i][j]=-1;
		}
	
		return dp(0,a-1);
	}
	

Compilation message (stderr)

boxes.cpp: In function 'long long int dp(int, int)':
boxes.cpp:26: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: 10 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30