oj.uz

Submission #128187

# Submission time Handle Problem Language Result Execution time Memory
128187 2019-07-10T13:46:47 Z zeyad49 Boxes with souvenirs (IOI15_boxes) C++17
10 / 100
 6 ms 4344 KB 
#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;
		}
		
		return 2*ans;
	}

Compilation message

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
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 6 ms 4216 KB Output is correct
3 Correct 6 ms 4216 KB Output is correct
4 Correct 6 ms 4216 KB Output is correct
5 Correct 6 ms 4216 KB Output is correct
6 Correct 5 ms 4344 KB Output is correct
7 Correct 6 ms 4216 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 4216 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 6 ms 4216 KB Output is correct
3 Correct 6 ms 4216 KB Output is correct
4 Correct 6 ms 4216 KB Output is correct
5 Correct 6 ms 4216 KB Output is correct
6 Correct 5 ms 4344 KB Output is correct
7 Correct 6 ms 4216 KB Output is correct
8 Incorrect 5 ms 4216 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 6 ms 4216 KB Output is correct
3 Correct 6 ms 4216 KB Output is correct
4 Correct 6 ms 4216 KB Output is correct
5 Correct 6 ms 4216 KB Output is correct
6 Correct 5 ms 4344 KB Output is correct
7 Correct 6 ms 4216 KB Output is correct
8 Incorrect 5 ms 4216 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 6 ms 4216 KB Output is correct
3 Correct 6 ms 4216 KB Output is correct
4 Correct 6 ms 4216 KB Output is correct
5 Correct 6 ms 4216 KB Output is correct
6 Correct 5 ms 4344 KB Output is correct
7 Correct 6 ms 4216 KB Output is correct
8 Incorrect 5 ms 4216 KB Output isn't correct
9 Halted 0 ms 0 KB -