# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134707 | 2019-07-23T07:39:29 Z | Boxworld | Boxes with souvenirs (IOI15_boxes) | C++14 | 2 ms | 376 KB |
#include "boxes.h" #include <bits/stdc++.h> using namespace std; long long delivery(int N, int K, int L, int p[]){ int m=-1; long long ans=0; for (int i=0;i<N;i++) if (p[i]*2<L)m=i; for (int i=m;i>=0;i-=K)ans+=p[i]*2; for (int i=m+1;i<N;i+=K)ans+=(L-p[i])*2; if (m==-1||m==N-1)return ans; int r=m,l=m+1; for (int j=0;j*K<=N;j++){ long long ans1=j*L; for (int i=0;i<K;i++){ if (r==0)l--; else if (l==N-1)r++; else if (p[r]>L-p[l])r--; else l++; } for (int i=r;i>=0;i-=K)ans1+=p[i]*2; for (int i=l;i<N;i+=K)ans1+=(L-p[i])*2; ans=min(ans,ans1); } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Incorrect | 2 ms | 256 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Incorrect | 2 ms | 256 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Incorrect | 2 ms | 256 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Incorrect | 2 ms | 256 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |