# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
307688 | 2020-09-29T05:45:16 Z | kylych03 | Boxes with souvenirs (IOI15_boxes) | C++14 | 1 ms | 384 KB |
#include <bits/stdc++.h> #include "boxes.h" //#include "grader.cpp" using namespace std; long long pra[100001], prb[100001]; long long delivery(int N, int K, int L, int p[]) { sort(p, p+N); vector <long long > a,b; for(int i = 0; i < N; i++){ if(p[i] <= L/2) a.push_back(p[i]); else b.push_back(L-p[i]); } sort(b.begin(), b.end()); long long res = 0; for(int i = 0 ; i < a.size();i++) if(i<K) pra[i] = a[i]*2; else pra[i] = a[i] * 2 + pra[i-K]; for(int i = 0 ; i < b.size();i++) if(i<K) prb[i] = b[i]*2; else prb[i] = b[i] * 2 + prb[i-K]; if(a.size()==0) res = prb[b.size() -1 ]; else if(b.size()==0) res = pra[a.size() -1 ]; else res = pra[a.size() - 1] + prb[b.size() -1 ]; int x = 0; for(int i = a.size() - 2, j= 1; j <= K && i>=0 ; j++,i--){ if(b.size() >= K - j) x = prb[b.size() - (K-j)-1]; else x = 0; res = min (res, pra[i] + L + x); } return res; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Incorrect | 0 ms | 384 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
4 | Incorrect | 0 ms | 384 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 0 ms | 384 KB | Output is correct |
4 | Correct | 1 ms | 256 KB | Output is correct |
5 | Correct | 0 ms | 384 KB | Output is correct |
6 | Correct | 0 ms | 384 KB | Output is correct |
7 | Correct | 0 ms | 256 KB | Output is correct |
8 | Correct | 0 ms | 256 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Incorrect | 0 ms | 384 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Incorrect | 0 ms | 384 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Incorrect | 0 ms | 384 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |