| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 905066 | 2024-01-12T13:49:04 Z | VMaksimoski008 | Boxes with souvenirs (IOI15_boxes) | C++14 | 162 ms | 600 KB |
#include <bits/stdc++.h>
#include "boxes.h"
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;
void setIO() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
ll delivery(int N, int K, int L, int pos[]) {
if(K == 1) {
ll ans = 0;
for(int i=0; i<N; i++)
ans += 2 * min(pos[i], L - pos[i]);
return ans;
}
if(K == N) {
set<int> s;
for(int i=0; i<N; i++) s.insert(pos[i]);
vector<int> p(all(s));
ll ans = 0;
int cnt = 0;
int curr = 0;
vector<bool> vis(sz(p), 0);
while(cnt != sz(p)) {
ll mn = 1e18;
int pos = 0;
for(int i=0; i<sz(p); i++) {
if(vis[i]) continue;
ll d = abs(p[i] - curr);
if(L + curr - p[i] < d) d = L + curr - p[i];
if(d < mn) {
mn = d;
pos = i;
}
}
vis[pos] = 1;
ans += mn;
curr = p[pos];
cnt++;
}
return ans + min(curr, L - curr);
}
if(N <= 10) {
vector<int> p;
for(int i=0; i<N; i++) p.push_back(pos[i]);
sort(all(p));
ll ans = 1e18;
do {
ll res = 0;
int curr = 0;
for(int i=0; i<N; i++) {
ll d = abs(p[i] - curr);
if(L + curr - p[i] < d) d = L + curr - p[i];
res += d;
curr = p[i];
if(i % K == K - 1) {
res += min(curr, L - curr);
curr = 0;
}
}
res += min(curr, L - curr);
ans = min(ans, res);
} while(next_permutation(all(p)));
return ans;
}
if(N <= 1000) {
ll ans = 0;
int cnt = 0;
int curr = 0;
vector<bool> vis(N, 0);
while(cnt != N) {
ll mn = 1e18;
int p = 0;
for(int i=0; i<N; i++) {
if(vis[i]) continue;
ll d = abs(pos[i] - curr);
if(L + curr - pos[i] < d) d = L + curr - pos[i];
if(cnt % K == K - 1) d += min(pos[i], L - pos[i]);
if(d < mn) {
mn = d;
p = i;
}
}
vis[p] = 1;
ans += mn;
curr = (cnt % K == K - 1 ? 0 : pos[p]);
cnt++;
}
return ans;
}
return 0;
}
Compilation message
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 344 KB | Output is correct |
| 2 | Correct | 0 ms | 348 KB | Output is correct |
| 3 | Correct | 0 ms | 348 KB | Output is correct |
| 4 | Correct | 1 ms | 600 KB | Output is correct |
| 5 | Correct | 0 ms | 348 KB | Output is correct |
| 6 | Correct | 1 ms | 348 KB | Output is correct |
| 7 | Correct | 0 ms | 348 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 348 KB | Output is correct |
| 2 | Correct | 1 ms | 344 KB | Output is correct |
| 3 | Correct | 0 ms | 348 KB | Output is correct |
| 4 | Correct | 0 ms | 348 KB | Output is correct |
| 5 | Correct | 1 ms | 348 KB | Output is correct |
| 6 | Correct | 2 ms | 348 KB | Output is correct |
| 7 | Correct | 1 ms | 348 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 348 KB | Output is correct |
| 2 | Correct | 1 ms | 348 KB | Output is correct |
| 3 | Correct | 0 ms | 348 KB | Output is correct |
| 4 | Correct | 1 ms | 600 KB | Output is correct |
| 5 | Correct | 1 ms | 348 KB | Output is correct |
| 6 | Correct | 157 ms | 344 KB | Output is correct |
| 7 | Correct | 162 ms | 408 KB | Output is correct |
| 8 | Correct | 158 ms | 408 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 344 KB | Output is correct |
| 2 | Correct | 0 ms | 348 KB | Output is correct |
| 3 | Correct | 0 ms | 348 KB | Output is correct |
| 4 | Correct | 1 ms | 600 KB | Output is correct |
| 5 | Correct | 0 ms | 348 KB | Output is correct |
| 6 | Correct | 1 ms | 348 KB | Output is correct |
| 7 | Correct | 0 ms | 348 KB | Output is correct |
| 8 | Correct | 1 ms | 348 KB | Output is correct |
| 9 | Correct | 1 ms | 344 KB | Output is correct |
| 10 | Correct | 0 ms | 348 KB | Output is correct |
| 11 | Correct | 0 ms | 348 KB | Output is correct |
| 12 | Correct | 1 ms | 348 KB | Output is correct |
| 13 | Correct | 2 ms | 348 KB | Output is correct |
| 14 | Correct | 1 ms | 348 KB | Output is correct |
| 15 | Correct | 1 ms | 348 KB | Output is correct |
| 16 | Correct | 1 ms | 348 KB | Output is correct |
| 17 | Correct | 0 ms | 348 KB | Output is correct |
| 18 | Correct | 1 ms | 600 KB | Output is correct |
| 19 | Correct | 1 ms | 348 KB | Output is correct |
| 20 | Correct | 157 ms | 344 KB | Output is correct |
| 21 | Correct | 162 ms | 408 KB | Output is correct |
| 22 | Correct | 158 ms | 408 KB | Output is correct |
| 23 | Correct | 3 ms | 348 KB | Output is correct |
| 24 | Incorrect | 3 ms | 344 KB | Output isn't correct |
| 25 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 344 KB | Output is correct |
| 2 | Correct | 0 ms | 348 KB | Output is correct |
| 3 | Correct | 0 ms | 348 KB | Output is correct |
| 4 | Correct | 1 ms | 600 KB | Output is correct |
| 5 | Correct | 0 ms | 348 KB | Output is correct |
| 6 | Correct | 1 ms | 348 KB | Output is correct |
| 7 | Correct | 0 ms | 348 KB | Output is correct |
| 8 | Correct | 1 ms | 348 KB | Output is correct |
| 9 | Correct | 1 ms | 344 KB | Output is correct |
| 10 | Correct | 0 ms | 348 KB | Output is correct |
| 11 | Correct | 0 ms | 348 KB | Output is correct |
| 12 | Correct | 1 ms | 348 KB | Output is correct |
| 13 | Correct | 2 ms | 348 KB | Output is correct |
| 14 | Correct | 1 ms | 348 KB | Output is correct |
| 15 | Correct | 1 ms | 348 KB | Output is correct |
| 16 | Correct | 1 ms | 348 KB | Output is correct |
| 17 | Correct | 0 ms | 348 KB | Output is correct |
| 18 | Correct | 1 ms | 600 KB | Output is correct |
| 19 | Correct | 1 ms | 348 KB | Output is correct |
| 20 | Correct | 157 ms | 344 KB | Output is correct |
| 21 | Correct | 162 ms | 408 KB | Output is correct |
| 22 | Correct | 158 ms | 408 KB | Output is correct |
| 23 | Correct | 3 ms | 348 KB | Output is correct |
| 24 | Incorrect | 3 ms | 344 KB | Output isn't correct |
| 25 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 344 KB | Output is correct |
| 2 | Correct | 0 ms | 348 KB | Output is correct |
| 3 | Correct | 0 ms | 348 KB | Output is correct |
| 4 | Correct | 1 ms | 600 KB | Output is correct |
| 5 | Correct | 0 ms | 348 KB | Output is correct |
| 6 | Correct | 1 ms | 348 KB | Output is correct |
| 7 | Correct | 0 ms | 348 KB | Output is correct |
| 8 | Correct | 1 ms | 348 KB | Output is correct |
| 9 | Correct | 1 ms | 344 KB | Output is correct |
| 10 | Correct | 0 ms | 348 KB | Output is correct |
| 11 | Correct | 0 ms | 348 KB | Output is correct |
| 12 | Correct | 1 ms | 348 KB | Output is correct |
| 13 | Correct | 2 ms | 348 KB | Output is correct |
| 14 | Correct | 1 ms | 348 KB | Output is correct |
| 15 | Correct | 1 ms | 348 KB | Output is correct |
| 16 | Correct | 1 ms | 348 KB | Output is correct |
| 17 | Correct | 0 ms | 348 KB | Output is correct |
| 18 | Correct | 1 ms | 600 KB | Output is correct |
| 19 | Correct | 1 ms | 348 KB | Output is correct |
| 20 | Correct | 157 ms | 344 KB | Output is correct |
| 21 | Correct | 162 ms | 408 KB | Output is correct |
| 22 | Correct | 158 ms | 408 KB | Output is correct |
| 23 | Correct | 3 ms | 348 KB | Output is correct |
| 24 | Incorrect | 3 ms | 344 KB | Output isn't correct |
| 25 | Halted | 0 ms | 0 KB | - |