oj.uz

Submission #16529

# Submission time Handle Problem Language Result Execution time Memory
16529 2015-08-27T07:58:34 Z gs13068 Boxes with souvenirs (IOI15_boxes) C++
0 / 100
 2 ms 380 KB 
#include <algorithm>

long long L[11111111];
long long R[11111111];

long long delivery(int n,int k,int l,int a[])
{
	long long r=1e18;
    int i;
    for(i=1;i<=n;i++)
	{
		L[i]=std::min(a[i-1]<<1,l);
        if(i>k)L[i]+=L[i-k];
	}
    for(i=n-1;i>=0;i--)
	{
		R[i]=std::min((l-a[i])<<1,l);
		if(i+k<n)R[i]+=R[i+k];
	}
	for(i=0;i<n;i++)r=std::min(r,L[i]+R[i+1]);
	return r;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 15.0

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

Subtask #4
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 #5
0 / 20.0

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

Subtask #6
0 / 30.0

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