//Never stop trying
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef string str;
typedef long long ll;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up
template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))
#define dbg(x) cerr << " - " << #x << " : " << x << endl;
#define dbgs(x,y) cerr << " - " << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << " - " << #v << " : " << endl << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
void IO() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int N,K,L;
vi pos;
V<ll> CW(MX),CCW(MX);
void precompute(){
FOR(i,0,N){
ll x=0;
if(i-K>=0) x+=CW[i-K];
x+=pos[i]*2;
CW[i]=x;
}
//FOR(i,0,N) cout << CW[i] << ' '; cout << endl;
ROF(i,0,N){
ll x=0;
if(i+K<N) x+=CCW[i+K];
x+=(L-pos[i])*2;
CCW[i]=x;
}
//FOR(i,0,N) cout << CCW[i] << ' '; cout << endl;
}
ll delivery(int NN, int KK, int LL, int positions[]){
N=NN; K=KK; L=LL; FOR(i,0,N) pos.pb(positions[i]);
sort(all(pos));
precompute();
ll ans=min(CW[N-1],CCW[0]);
FOR(i,0,N){
int l=i,r=i+K-1; ckmin(r,N-1);
ll x=L;
if(l) x+=CW[l-1];
if(r+1<N) x+=CCW[r+1];
ckmin(ans,x);
x=CW[i]; if(i+1<N) x+=CCW[i+1];
ckmin(ans,x);
}
return ans;
}
/*
3 2 8
1 2 5
*/
/* Careful!!!
.Array bounds
.Infinite loops
.Uninitialized variables / empty containers
.Order of input
Some insights:
.Binary search
.Graph representation
.Write brute force code
.Change your approach
*/
Compilation message
boxes.cpp: In function 'void IO()':
boxes.cpp:47:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
47 | freopen("input.txt", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
boxes.cpp:48:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
48 | freopen("output.txt", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
3456 KB |
Output is correct |
2 |
Correct |
3 ms |
3456 KB |
Output is correct |
3 |
Correct |
2 ms |
3456 KB |
Output is correct |
4 |
Correct |
3 ms |
3456 KB |
Output is correct |
5 |
Correct |
3 ms |
3456 KB |
Output is correct |
6 |
Correct |
3 ms |
3456 KB |
Output is correct |
7 |
Correct |
3 ms |
3456 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
3456 KB |
Output is correct |
2 |
Correct |
3 ms |
3456 KB |
Output is correct |
3 |
Correct |
3 ms |
3456 KB |
Output is correct |
4 |
Correct |
3 ms |
3456 KB |
Output is correct |
5 |
Correct |
3 ms |
3508 KB |
Output is correct |
6 |
Correct |
3 ms |
3456 KB |
Output is correct |
7 |
Correct |
2 ms |
3456 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
3456 KB |
Output is correct |
2 |
Correct |
2 ms |
3456 KB |
Output is correct |
3 |
Correct |
2 ms |
3456 KB |
Output is correct |
4 |
Correct |
3 ms |
3456 KB |
Output is correct |
5 |
Correct |
2 ms |
3456 KB |
Output is correct |
6 |
Correct |
2 ms |
3456 KB |
Output is correct |
7 |
Correct |
2 ms |
3456 KB |
Output is correct |
8 |
Correct |
2 ms |
3456 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
3456 KB |
Output is correct |
2 |
Correct |
3 ms |
3456 KB |
Output is correct |
3 |
Correct |
2 ms |
3456 KB |
Output is correct |
4 |
Correct |
3 ms |
3456 KB |
Output is correct |
5 |
Correct |
3 ms |
3456 KB |
Output is correct |
6 |
Correct |
3 ms |
3456 KB |
Output is correct |
7 |
Correct |
3 ms |
3456 KB |
Output is correct |
8 |
Correct |
2 ms |
3456 KB |
Output is correct |
9 |
Correct |
3 ms |
3456 KB |
Output is correct |
10 |
Correct |
3 ms |
3456 KB |
Output is correct |
11 |
Correct |
3 ms |
3456 KB |
Output is correct |
12 |
Correct |
3 ms |
3508 KB |
Output is correct |
13 |
Correct |
3 ms |
3456 KB |
Output is correct |
14 |
Correct |
2 ms |
3456 KB |
Output is correct |
15 |
Correct |
3 ms |
3456 KB |
Output is correct |
16 |
Correct |
2 ms |
3456 KB |
Output is correct |
17 |
Correct |
2 ms |
3456 KB |
Output is correct |
18 |
Correct |
3 ms |
3456 KB |
Output is correct |
19 |
Correct |
2 ms |
3456 KB |
Output is correct |
20 |
Correct |
2 ms |
3456 KB |
Output is correct |
21 |
Correct |
2 ms |
3456 KB |
Output is correct |
22 |
Correct |
2 ms |
3456 KB |
Output is correct |
23 |
Correct |
2 ms |
3456 KB |
Output is correct |
24 |
Correct |
2 ms |
3456 KB |
Output is correct |
25 |
Correct |
2 ms |
3456 KB |
Output is correct |
26 |
Correct |
2 ms |
3456 KB |
Output is correct |
27 |
Correct |
3 ms |
3456 KB |
Output is correct |
28 |
Correct |
2 ms |
3456 KB |
Output is correct |
29 |
Correct |
2 ms |
3524 KB |
Output is correct |
30 |
Correct |
2 ms |
3456 KB |
Output is correct |
31 |
Correct |
3 ms |
3456 KB |
Output is correct |
32 |
Correct |
3 ms |
3456 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
3456 KB |
Output is correct |
2 |
Correct |
3 ms |
3456 KB |
Output is correct |
3 |
Correct |
2 ms |
3456 KB |
Output is correct |
4 |
Correct |
3 ms |
3456 KB |
Output is correct |
5 |
Correct |
3 ms |
3456 KB |
Output is correct |
6 |
Correct |
3 ms |
3456 KB |
Output is correct |
7 |
Correct |
3 ms |
3456 KB |
Output is correct |
8 |
Correct |
2 ms |
3456 KB |
Output is correct |
9 |
Correct |
3 ms |
3456 KB |
Output is correct |
10 |
Correct |
3 ms |
3456 KB |
Output is correct |
11 |
Correct |
3 ms |
3456 KB |
Output is correct |
12 |
Correct |
3 ms |
3508 KB |
Output is correct |
13 |
Correct |
3 ms |
3456 KB |
Output is correct |
14 |
Correct |
2 ms |
3456 KB |
Output is correct |
15 |
Correct |
3 ms |
3456 KB |
Output is correct |
16 |
Correct |
2 ms |
3456 KB |
Output is correct |
17 |
Correct |
2 ms |
3456 KB |
Output is correct |
18 |
Correct |
3 ms |
3456 KB |
Output is correct |
19 |
Correct |
2 ms |
3456 KB |
Output is correct |
20 |
Correct |
2 ms |
3456 KB |
Output is correct |
21 |
Correct |
2 ms |
3456 KB |
Output is correct |
22 |
Correct |
2 ms |
3456 KB |
Output is correct |
23 |
Correct |
2 ms |
3456 KB |
Output is correct |
24 |
Correct |
2 ms |
3456 KB |
Output is correct |
25 |
Correct |
2 ms |
3456 KB |
Output is correct |
26 |
Correct |
2 ms |
3456 KB |
Output is correct |
27 |
Correct |
3 ms |
3456 KB |
Output is correct |
28 |
Correct |
2 ms |
3456 KB |
Output is correct |
29 |
Correct |
2 ms |
3524 KB |
Output is correct |
30 |
Correct |
2 ms |
3456 KB |
Output is correct |
31 |
Correct |
3 ms |
3456 KB |
Output is correct |
32 |
Correct |
3 ms |
3456 KB |
Output is correct |
33 |
Runtime error |
102 ms |
32608 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
34 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
3456 KB |
Output is correct |
2 |
Correct |
3 ms |
3456 KB |
Output is correct |
3 |
Correct |
2 ms |
3456 KB |
Output is correct |
4 |
Correct |
3 ms |
3456 KB |
Output is correct |
5 |
Correct |
3 ms |
3456 KB |
Output is correct |
6 |
Correct |
3 ms |
3456 KB |
Output is correct |
7 |
Correct |
3 ms |
3456 KB |
Output is correct |
8 |
Correct |
2 ms |
3456 KB |
Output is correct |
9 |
Correct |
3 ms |
3456 KB |
Output is correct |
10 |
Correct |
3 ms |
3456 KB |
Output is correct |
11 |
Correct |
3 ms |
3456 KB |
Output is correct |
12 |
Correct |
3 ms |
3508 KB |
Output is correct |
13 |
Correct |
3 ms |
3456 KB |
Output is correct |
14 |
Correct |
2 ms |
3456 KB |
Output is correct |
15 |
Correct |
3 ms |
3456 KB |
Output is correct |
16 |
Correct |
2 ms |
3456 KB |
Output is correct |
17 |
Correct |
2 ms |
3456 KB |
Output is correct |
18 |
Correct |
3 ms |
3456 KB |
Output is correct |
19 |
Correct |
2 ms |
3456 KB |
Output is correct |
20 |
Correct |
2 ms |
3456 KB |
Output is correct |
21 |
Correct |
2 ms |
3456 KB |
Output is correct |
22 |
Correct |
2 ms |
3456 KB |
Output is correct |
23 |
Correct |
2 ms |
3456 KB |
Output is correct |
24 |
Correct |
2 ms |
3456 KB |
Output is correct |
25 |
Correct |
2 ms |
3456 KB |
Output is correct |
26 |
Correct |
2 ms |
3456 KB |
Output is correct |
27 |
Correct |
3 ms |
3456 KB |
Output is correct |
28 |
Correct |
2 ms |
3456 KB |
Output is correct |
29 |
Correct |
2 ms |
3524 KB |
Output is correct |
30 |
Correct |
2 ms |
3456 KB |
Output is correct |
31 |
Correct |
3 ms |
3456 KB |
Output is correct |
32 |
Correct |
3 ms |
3456 KB |
Output is correct |
33 |
Runtime error |
102 ms |
32608 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
34 |
Halted |
0 ms |
0 KB |
- |