# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
30549 | 2017-07-24T15:00:35 Z | Nikefor | Boxes with souvenirs (IOI15_boxes) | C++ | 2 ms | 376 KB |
#include "boxes.h" #include <bits/stdc++.h> #include <algorithm> using namespace std; long long delivery(int N, int K, int L, int p[]) { long long sum = 0; if(N==1) { for(int i=0; i<N; i++) { sum+=p[i]; sum+= (p[i]<(N-p[i]))?p[i]:(N-p[i]); } } else if(K==N) { bool flag = true; int big = 0; int small = 0; int mini=1<<17; long long maxi = 0; for (int i = 0; i < N; ++i) { mini = (mini<p[i])?mini:p[i]; maxi = (maxi>p[i])?maxi:p[i]; if(p[i]>(N>>1)) big++; if(p[i]<(N>>1)) big++; } if(!big) sum = maxi<<1; else if(!small) sum = (N-mini)<<1; else sum = L; } return sum; }
Compilation message
# | 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 | 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 | 256 KB | Output isn't correct |
2 | 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 | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |