# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
920042 | 2024-02-02T02:28:31 Z | coding_snorlax | Boxes with souvenirs (IOI15_boxes) | C++14 | 1 ms | 348 KB |
#include "boxes.h" #include<bits/stdc++.h> #define ll long long int using namespace std; vector<ll> P; ll N,K,L; long long split(int C){ ll answer = 0; answer = 2*(P[C]+(L-P[C+1])); //cout << answer << " "; return answer; } long long delivery(int n, int k, int l, int p[]) { for(int i=0;i<N;i++) P.push_back((ll)p[i]); sort(P.begin(),P.end()); ll answer = L,Max=0,Min=L; N=n;K=k;L=l; for(int i:P) {Max = max(Max,(ll)i),Min = min(Min,(ll)i);} for(int i=0;i<N-1;i++){ answer = min(split(i),answer); } answer = min(answer,2*min(Max,(ll)L-Min)); return answer; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 348 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 344 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |