#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
ll delivery(int N,int K,int L,int pos[]){
ll pre[N+5],suf[N+5],ans=1e18;
suf[N]=0;
for(int i=0;i<K;i++){
pre[i]=pos[i];
}
for(int i=K;i<N;i++){
pre[i]=pre[i-K]+pos[i];
}
for(int i=N-1;i>=N-K;i--){
suf[i]=L-pos[i];
}
for(int i=N-K-1;i>=0;i--){
suf[i]=suf[i+K]+(L-pos[i]);
}
ans=min(ans,suf[0]*2);
for(int i=0;i<N-1;i++){
ans=min(ans,pre[i]*2+suf[i+1]*2);
}
ans=min(ans,suf[K]*2+L);
for(int i=K;i<=N;i++){
ans=min(ans,pre[i-K]*2+suf[i+1]*2+L);
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |