#include "boxes.h"
#include<algorithm>
using namespace std;
int count_clock[20000000],clock[20000000],pat;
long long delivery(int N, int K, int L, int p[]) {
for(int i=0;i<N;i++)
{
if(i<K)
clock[i]=2*p[i];
else
clock[i]=clock[i-K]+2*p[i];
}
pat=clock[N-1];
for(int i=N-1;i>=0;i--)
{
if(i+K>N-1)
count_clock[i]=2*(L-p[i]);
else
count_clock[i]=count_clock[i+K]+2*(L-p[i]);
}
pat=min(pat,count_clock[0]);
pat=min(count_clock[K]+L,pat);
for(int i=0;i<N-K;i++)
pat=min(clock[i]+count_clock[i+K+1]+L,pat);
for(int i=0;i<N;i++)
pat=min(clock[i]+count_clock[i+1],pat);
return pat;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
292 KB |
Output is correct |
3 |
Correct |
2 ms |
256 KB |
Output is correct |
4 |
Correct |
2 ms |
256 KB |
Output is correct |
5 |
Correct |
2 ms |
348 KB |
Output is correct |
6 |
Correct |
2 ms |
256 KB |
Output is correct |
7 |
Correct |
2 ms |
256 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Incorrect |
2 ms |
380 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |