oj.uz

Submission #813369

# Submission time Handle Problem Language Result Execution time Memory
813369 2023-08-07T16:26:28 Z OrazB Boxes with souvenirs (IOI15_boxes) C++14
100 / 100
 1418 ms 165280 KB 
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <ll, ll>
#define pb push_back
#define ff first
#define ss second

const int N = 1e7+5;
ll dp[N];

ll F(ll x, int t, ll L){
	ll cur = (t ? (L-x)*2 : x*2);
	return min(L, cur);
}

ll delivery(int n, int K, int L, int p[]){
	dp[0] = min(F(p[0], 1, L), F(p[0], 0, L));
	int pos = 0;
	priority_queue<pii> s;
	s.push({-F(p[0], 1, L), 0});
	for (int i = 1; i < n; i++){
		if (i-K < 0) dp[i] = min(F(p[0], 1, L), F(p[i], 0, L));
		else dp[i] = dp[i-K]+min(F(p[i-K+1], 1, L), F(p[i], 0, L));

		dp[i] = min(dp[i], dp[i-1]+F(p[i], 1, L));
		
		while(s.size() and s.top().ss < i-K+1) s.pop();
		
		if (s.size()) dp[i] = min(dp[i], -s.top().ff);
		s.push({-(dp[i-1]+F(p[i], 1, L)), i});
	}
	return dp[n-1];
}


// int main ()
// {
// 	ios::sync_with_stdio(false);
// 	cin.tie(0);
// 	int n, k, l;
// 	cin >> n >> k >> l;
// 	int p[n];
// 	for (int i = 0; i < n; i++) cin >> p[i];
// 	cout << delivery(n, k, l, p);
// }

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:20:6: warning: unused variable 'pos' [-Wunused-variable]
   20 |  int pos = 0;
      |      ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 308 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 316 KB Output is correct
24 Correct 0 ms 316 KB Output is correct
25 Correct 0 ms 312 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 0 ms 312 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 312 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 308 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 316 KB Output is correct
24 Correct 0 ms 316 KB Output is correct
25 Correct 0 ms 312 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 0 ms 312 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 312 KB Output is correct
33 Correct 119 ms 12428 KB Output is correct
34 Correct 112 ms 15368 KB Output is correct
35 Correct 33 ms 12976 KB Output is correct
36 Correct 119 ms 12420 KB Output is correct
37 Correct 120 ms 12292 KB Output is correct
38 Correct 115 ms 12352 KB Output is correct
39 Correct 103 ms 12444 KB Output is correct
40 Correct 115 ms 12260 KB Output is correct
41 Correct 116 ms 12280 KB Output is correct
42 Correct 99 ms 12392 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 308 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 316 KB Output is correct
24 Correct 0 ms 316 KB Output is correct
25 Correct 0 ms 312 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 0 ms 312 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 312 KB Output is correct
33 Correct 119 ms 12428 KB Output is correct
34 Correct 112 ms 15368 KB Output is correct
35 Correct 33 ms 12976 KB Output is correct
36 Correct 119 ms 12420 KB Output is correct
37 Correct 120 ms 12292 KB Output is correct
38 Correct 115 ms 12352 KB Output is correct
39 Correct 103 ms 12444 KB Output is correct
40 Correct 115 ms 12260 KB Output is correct
41 Correct 116 ms 12280 KB Output is correct
42 Correct 99 ms 12392 KB Output is correct
43 Correct 1140 ms 133556 KB Output is correct
44 Correct 1112 ms 157016 KB Output is correct
45 Correct 306 ms 121064 KB Output is correct
46 Correct 1326 ms 134016 KB Output is correct
47 Correct 1418 ms 125952 KB Output is correct
48 Correct 1185 ms 118380 KB Output is correct
49 Correct 1160 ms 165280 KB Output is correct
50 Correct 1177 ms 138372 KB Output is correct
51 Correct 1289 ms 127816 KB Output is correct
52 Correct 1057 ms 130552 KB Output is correct