# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
712512 | 2023-03-19T00:53:07 Z | Username4132 | Boxes with souvenirs (IOI15_boxes) | C++14 | 1 ms | 340 KB |
#include "boxes.h" #include<iostream> #include<vector> using namespace std; using ll = long long; #define forn(i, n) for(int i=0; i<(int)n; ++i) const int MAXN=10000010; int le[MAXN], ri[MAXN], cnl=0, cnr=0; ll dpl[MAXN], dpr[MAXN]; long long delivery(int N, int K, int L, int p[]) { forn(i, N){ if(p[i]<(L>>1)) le[cnl++]=p[i]; else ri[cnr++]=L-p[i]; } forn(i, cnl){ if(i<K) dpl[i]=le[i]; else dpl[i]=dpl[i-K]+le[i]; } forn(i, cnr){ if(i<K) dpr[i]=ri[i]; else dpr[i]=dpr[i-K]+ri[i]; } ll ans = (dpl[cnl-1]+dpr[cnr-1])<<1; forn(i, K+1){ ans = min(ans, (dpl[cnl-1-i] + dpr[cnr-1-K+i])<<1 + L); } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |