#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a,b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a,b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
#include "boxes.h"
long long delivery(int n, int k, int L, int A[]) {
vector<int> a;
rep(i,n) a.pb(A[i]);
sort(all(a));
reverse(all(a));
while(!a.empty() and !a.back()) a.pop_back();
reverse(all(a));
if(a.empty()) return 0;
n = sz(a);
a.insert(a.begin(),0);
ll ans = inf2;
auto d = [&](ll x, ll y){
if(x > y) swap(x,y);
ll d = y-x;
return min(d,L-d);
};
do{
ll curr = 0;
ll pos = 0;
rep1(i,n){
if(i%k == 1){
curr += d(pos,0);
pos = 0;
}
curr += d(pos,a[i]);
pos = a[i];
}
curr += d(pos,0);
amin(ans,curr);
} while(next_permutation(a.begin()+1,a.begin()+n+1));
return ans;
// ll ans = inf2;
// rep(f,n+1){
// ll cost = 0;
// ll b = n-f;
// for(int i = k; i <= f; i += k){
// cost += a[i];
// cost += min(a[i],L-a[i]);
// }
// if(f%k){
// cost += a[f];
// cost += min(a[f],L-a[f]);
// }
// for(int i = k; i <= b; i += k){
// cost += L-a[n-i+1];
// cost += min(a[n-i+1],L-a[n-i+1]);
// }
// if(b%k){
// cost += L-a[n-b+1];
// cost += min(a[n-b+1],L-a[n-b+1]);
// }
// cout << f << " " << cost << endl;
// amin(ans,cost);
// }
// return ans;
}
Compilation message
boxes.cpp: In lambda function:
boxes.cpp:79:12: warning: declaration of 'd' shadows a previous local [-Wshadow]
79 | ll d = y-x;
| ^
boxes.cpp:77:10: note: shadowed declaration is here
77 | auto d = [&](ll x, ll y){
| ^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
352 KB |
Output is correct |
2 |
Execution timed out |
2019 ms |
352 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2051 ms |
352 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 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 |
156 ms |
348 KB |
Output is correct |
6 |
Correct |
155 ms |
412 KB |
Output is correct |
7 |
Correct |
161 ms |
412 KB |
Output is correct |
8 |
Correct |
155 ms |
412 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
352 KB |
Output is correct |
2 |
Execution timed out |
2019 ms |
352 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
352 KB |
Output is correct |
2 |
Execution timed out |
2019 ms |
352 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
352 KB |
Output is correct |
2 |
Execution timed out |
2019 ms |
352 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |