| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1331227 | michael12 | Boxes with souvenirs (IOI15_boxes) | C++20 | 1 ms | 344 KiB |
#include "boxes.h"
#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define endl '\n'
using namespace std;
const int maxn = 1e6 + 5;
const int inf = 1e9 + 5;
long long delivery(int N, int K, int L, int p[]){
long long cur = 0;
vector<int> ps(N);
for(int i = 0; i < N; i++){
ps[i] = p[i];
}
for(int i = 0; i < N; i++){
cur += min(ps[i], L - ps[i]);
}
return cur * 2;
}
// signed main(){
// int n, k, l;
// cin >> n >> k >> l;
// int a[n];
// for(int i = 0; i < n; i++){
// cin >> a[i];
// }
// cout << delivery(n, k, l, a);
// }| # | 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... | ||||
