#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
const long long INFll = (long long) 1e18 + 10;
const int INFii = (int) 1e9 + 10;
typedef long long ll;
typedef int ii;
typedef long double dbl;
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
#define maxn 10000010
ii n, kt;
ll dp1[maxn];
ii x1[maxn], x2[maxn];
priority_queue<pair<ll,ii>, vector<pair<ll,ii>>, greater<pair<ll,ii>>> pq1;
long long delivery(int N, int K, int L, int p[]) {
L--;
n = N;
kt = K;
for(ii i = 1; i <= n; i++) {
x1[i] = p[i-1];
x2[i] = L-x1[i]+1;
}
reverse(x2+1,x2+1+n);
pq1.push(mp(0,0));
for(ii i = 1; i <= n; i++) {
while(pq1.size() && pq1.top().sc < i-kt) pq1.pop();
dp1[i] = pq1.top().fr + x1[i] + min(x1[i],x2[n-i+1]);
pq1.push(mp(dp1[i],i));
}
ll ans = dp1[n];
while(pq1.size()) pq1.pop();
pq1.push(mp(0,0));
for(ii i = 1; i <= n; i++) {
while(pq1.size() && pq1.top().sc < i-kt) pq1.pop();
ans = min(ans,dp1[n-i]+pq1.top().fr + x2[i] + min(x1[n-i+1],x2[i]));
pq1.push(mp(pq1.top().fr + x2[i] + min(x1[n-i+1],x2[i]),i));
}
return ans;
}
// #include <bits/stdc++.h>
// using namespace std;
// const long long INFll = (long long) 1e18 + 10;
// const int INFii = (int) 1e9 + 10;
// typedef long long ll;
// typedef int ii;
// typedef long double dbl;
// #define endl '\n'
// #define sc second
// #define fr first
// #define mp make_pair
// #define pb push_back
// #define all(x) x.begin(), x.end()
// #define maxn 1100
// ll n, kt;
// ll mark1[maxn], dp1[maxn], x1[maxn];
// ll mark2[maxn], dp2[maxn], x2[maxn];
// ll sol1(ll i) {
// if(i == 0) return 0;
// if(dp1[i] != -1) return dp1[i];
// ll ans = INFll;
// for(ii j = i-1; j >= i-kt && j >= 0; j--) {
// ans = min(ans, sol1(j));
// }
// return dp1[i] = ans + x1[i] + min(x1[i],x2[n-i+1]);
// }
// ll sol2(ll i) {
// if(i == 0) return 0;
// if(dp2[i] != -1) return dp2[i];
// ll ans = INFll;
// for(ii j = i-1; j >= i-kt && j >= 0; j--) {
// ans = min(ans, sol2(j));
// }
// return dp2[i] = ans + x2[i] + min(x1[n-i+1],x2[i]);
// }
// int main() {
// ios::sync_with_stdio(false); cin.tie(0);
// //freopen("in.in", "r", stdin);
// //freopen("out.out", "w", stdout);
// ii N, K, L;
// cin >> N >> K >> L;
// vector<ii> p;
// for(ii i = 0; i < N; i++) {
// ii aa; cin >> aa;
// p.pb(aa);
// }
// L--;
// n = N;
// kt = K;
// for(ii i = 1; i <= n; i++) {
// dp1[i] = dp2[i] = -1;
// x1[i] = p[i-1];
// x2[i] = L-x1[i]+1;
// }
// reverse(x2+1,x2+1+n);
// ll ans = INFll;
// for(ii i = 0; i <= n; i++) {
// ans = min(ans, (sol1(i)) + (sol2(n-i)));
// }
// cout << ans << endl;
// }
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
332 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
424 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
0 ms |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
332 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
332 KB |
Output is correct |
8 |
Correct |
1 ms |
424 KB |
Output is correct |
9 |
Correct |
1 ms |
332 KB |
Output is correct |
10 |
Correct |
1 ms |
332 KB |
Output is correct |
11 |
Correct |
0 ms |
332 KB |
Output is correct |
12 |
Correct |
1 ms |
332 KB |
Output is correct |
13 |
Correct |
1 ms |
332 KB |
Output is correct |
14 |
Correct |
1 ms |
332 KB |
Output is correct |
15 |
Correct |
0 ms |
204 KB |
Output is correct |
16 |
Correct |
1 ms |
204 KB |
Output is correct |
17 |
Correct |
1 ms |
204 KB |
Output is correct |
18 |
Correct |
1 ms |
204 KB |
Output is correct |
19 |
Correct |
0 ms |
204 KB |
Output is correct |
20 |
Correct |
1 ms |
204 KB |
Output is correct |
21 |
Correct |
1 ms |
204 KB |
Output is correct |
22 |
Correct |
1 ms |
204 KB |
Output is correct |
23 |
Correct |
1 ms |
332 KB |
Output is correct |
24 |
Correct |
1 ms |
460 KB |
Output is correct |
25 |
Correct |
1 ms |
332 KB |
Output is correct |
26 |
Correct |
1 ms |
332 KB |
Output is correct |
27 |
Correct |
1 ms |
332 KB |
Output is correct |
28 |
Correct |
1 ms |
332 KB |
Output is correct |
29 |
Correct |
1 ms |
332 KB |
Output is correct |
30 |
Correct |
1 ms |
332 KB |
Output is correct |
31 |
Correct |
1 ms |
332 KB |
Output is correct |
32 |
Correct |
1 ms |
332 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
332 KB |
Output is correct |
8 |
Correct |
1 ms |
424 KB |
Output is correct |
9 |
Correct |
1 ms |
332 KB |
Output is correct |
10 |
Correct |
1 ms |
332 KB |
Output is correct |
11 |
Correct |
0 ms |
332 KB |
Output is correct |
12 |
Correct |
1 ms |
332 KB |
Output is correct |
13 |
Correct |
1 ms |
332 KB |
Output is correct |
14 |
Correct |
1 ms |
332 KB |
Output is correct |
15 |
Correct |
0 ms |
204 KB |
Output is correct |
16 |
Correct |
1 ms |
204 KB |
Output is correct |
17 |
Correct |
1 ms |
204 KB |
Output is correct |
18 |
Correct |
1 ms |
204 KB |
Output is correct |
19 |
Correct |
0 ms |
204 KB |
Output is correct |
20 |
Correct |
1 ms |
204 KB |
Output is correct |
21 |
Correct |
1 ms |
204 KB |
Output is correct |
22 |
Correct |
1 ms |
204 KB |
Output is correct |
23 |
Correct |
1 ms |
332 KB |
Output is correct |
24 |
Correct |
1 ms |
460 KB |
Output is correct |
25 |
Correct |
1 ms |
332 KB |
Output is correct |
26 |
Correct |
1 ms |
332 KB |
Output is correct |
27 |
Correct |
1 ms |
332 KB |
Output is correct |
28 |
Correct |
1 ms |
332 KB |
Output is correct |
29 |
Correct |
1 ms |
332 KB |
Output is correct |
30 |
Correct |
1 ms |
332 KB |
Output is correct |
31 |
Correct |
1 ms |
332 KB |
Output is correct |
32 |
Correct |
1 ms |
332 KB |
Output is correct |
33 |
Correct |
167 ms |
19984 KB |
Output is correct |
34 |
Correct |
167 ms |
19936 KB |
Output is correct |
35 |
Correct |
59 ms |
19872 KB |
Output is correct |
36 |
Correct |
181 ms |
19908 KB |
Output is correct |
37 |
Correct |
185 ms |
19908 KB |
Output is correct |
38 |
Correct |
181 ms |
20012 KB |
Output is correct |
39 |
Correct |
168 ms |
19932 KB |
Output is correct |
40 |
Correct |
178 ms |
19880 KB |
Output is correct |
41 |
Correct |
163 ms |
19908 KB |
Output is correct |
42 |
Correct |
182 ms |
20036 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
332 KB |
Output is correct |
8 |
Correct |
1 ms |
424 KB |
Output is correct |
9 |
Correct |
1 ms |
332 KB |
Output is correct |
10 |
Correct |
1 ms |
332 KB |
Output is correct |
11 |
Correct |
0 ms |
332 KB |
Output is correct |
12 |
Correct |
1 ms |
332 KB |
Output is correct |
13 |
Correct |
1 ms |
332 KB |
Output is correct |
14 |
Correct |
1 ms |
332 KB |
Output is correct |
15 |
Correct |
0 ms |
204 KB |
Output is correct |
16 |
Correct |
1 ms |
204 KB |
Output is correct |
17 |
Correct |
1 ms |
204 KB |
Output is correct |
18 |
Correct |
1 ms |
204 KB |
Output is correct |
19 |
Correct |
0 ms |
204 KB |
Output is correct |
20 |
Correct |
1 ms |
204 KB |
Output is correct |
21 |
Correct |
1 ms |
204 KB |
Output is correct |
22 |
Correct |
1 ms |
204 KB |
Output is correct |
23 |
Correct |
1 ms |
332 KB |
Output is correct |
24 |
Correct |
1 ms |
460 KB |
Output is correct |
25 |
Correct |
1 ms |
332 KB |
Output is correct |
26 |
Correct |
1 ms |
332 KB |
Output is correct |
27 |
Correct |
1 ms |
332 KB |
Output is correct |
28 |
Correct |
1 ms |
332 KB |
Output is correct |
29 |
Correct |
1 ms |
332 KB |
Output is correct |
30 |
Correct |
1 ms |
332 KB |
Output is correct |
31 |
Correct |
1 ms |
332 KB |
Output is correct |
32 |
Correct |
1 ms |
332 KB |
Output is correct |
33 |
Correct |
167 ms |
19984 KB |
Output is correct |
34 |
Correct |
167 ms |
19936 KB |
Output is correct |
35 |
Correct |
59 ms |
19872 KB |
Output is correct |
36 |
Correct |
181 ms |
19908 KB |
Output is correct |
37 |
Correct |
185 ms |
19908 KB |
Output is correct |
38 |
Correct |
181 ms |
20012 KB |
Output is correct |
39 |
Correct |
168 ms |
19932 KB |
Output is correct |
40 |
Correct |
178 ms |
19880 KB |
Output is correct |
41 |
Correct |
163 ms |
19908 KB |
Output is correct |
42 |
Correct |
182 ms |
20036 KB |
Output is correct |
43 |
Execution timed out |
2098 ms |
211772 KB |
Time limit exceeded |
44 |
Halted |
0 ms |
0 KB |
- |