| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1332719 | simplemind_31 | Boxes with souvenirs (IOI15_boxes) | C++20 | 0 ms | 344 KiB |
#include "boxes.h"
#include <bits/stdc++.h>
#define REV(x) x.rbegin(),x.rend()
using namespace std;
typedef long long ll;
ll delivery(int N, int K, int L, int p[]) {
vector<int> p1,p2;
for(int i=0;i<N;i++){
if(p[i]*2<=L)p1.push_back(p[i]);
else p2.push_back(L-p[i]);
}
ll iz=0,de=0;
sort(REV(p1));
sort(REV(p2));
for(int i=0;i<p1.size();i+=K){
iz+=min(2*p1[i],L);
}
for(int i=0;i<p2.size();i+=K){
de+=min(2*p2[i],L);
}
return iz+de;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
