# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
118941 | 2019-06-20T05:45:40 Z | oolimry | Boxes with souvenirs (IOI15_boxes) | C++14 | 2 ms | 384 KB |
#include "boxes.h" #include <bits/stdc++.h> using namespace std; long long delivery(int N, int K, int L, int p[]) { long long n, k, l; n = N, k = K, l = L; int left[n]; int right[n]; for(int i = 0;i < n;i++){ if(i < k) left[i] = 2*p[i]; else left[i] = left[i-k] + p[i] * 2; } for(int i = n-1;i >= 0;i--){ if(i + k >= n) right[i] = (l - p[i]) * 2; else right[i] = right[i+k] + (l - p[i]) * 2; } //for(int i = 0;i < n;i++){ // cout << left[i] << " " << right[i] << "\n"; //} long long circles = n; long long ans = min(left[n-1], right[0]); for(int i = -1;i < n;i++){ long long value = 0; if(i != -1) value += left[i]; while(true){ if(circles == 0) break; int pnt2 = i + 1 + k * (circles - 1); if(pnt2 >= n){ circles--; } else if(L >= 2 * L - 2 * p[pnt2]){ circles--; } else{ break; } } value += circles * l; int endpnt = i + 1 + k * circles; if(endpnt < n) value += right[endpnt]; //cout << i << " " << circles << "\n"; ans = min(ans,value); } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Incorrect | 2 ms | 384 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 384 KB | Output is correct |
2 | Correct | 2 ms | 256 KB | Output is correct |
3 | Correct | 2 ms | 256 KB | Output is correct |
4 | Correct | 2 ms | 384 KB | Output is correct |
5 | Correct | 2 ms | 256 KB | Output is correct |
6 | Correct | 2 ms | 384 KB | Output is correct |
7 | Correct | 2 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 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 | 256 KB | Output is correct |
2 | Incorrect | 2 ms | 384 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Incorrect | 2 ms | 384 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Incorrect | 2 ms | 384 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |