oj.uz

Submission #591734

# Submission time Handle Problem Language Result Execution time Memory
591734 2022-07-07T19:47:27 Z l_reho Boxes with souvenirs (IOI15_boxes) C++14
100 / 100
 1443 ms 347528 KB 

#include <bits/stdc++.h>
using namespace std;

long long delivery(int N, int K, int L, int p[]) {

	vector<long long> dpA(N+1, 0);
	vector<long long> dpB(N+1, 0);
	
	for(int i = 1; i <= N; i++){
		if(i >= K){
			dpA[i] = dpA[i-K]+p[i-1]*2;
		}else dpA[i] = dpA[0]+p[i-1]*2;
	}
	
	priority_queue<pair<long long, int>> pq;
	
	vector<long long> M(N+1, 0);
		
	pq.push({0, N});
	
	for(int i = N-1; i >= 0; i--){
		if(i+K > N-1)
			dpB[i] = dpB[N] + (L-p[i])*2;
		else dpB[i] = dpB[i+K] + (L-p[i])*2;
		
		
		pq.push({-dpB[i], i});
		
		while(!pq.empty() && pq.top().second > i+K)
			pq.pop();
			
		
		M[i] = -pq.top().first;
	}
	
	long long ans = LLONG_MAX;
	
	for(int i = 0; i <= N; i++)
		ans = min(ans, dpA[i] + dpB[i]);
	
	for(int i = 0; i < N; i++){
		// eliminiamo questo ciclo
		ans = min(ans, dpA[i] + M[i] + (long long)L);
		
		/*
		for(int j = 1; j <= K; j++){
			if(i+j > N) break;
			
			ans = min(ans, dpA[i] + dpB[i+j] + (long long)L);
			
		}
		*/
	}
	
	// considerando che L è una costante, bisogna solo cercare i e i+j minimi
	// posso risolverlo Nlogn

	return ans;
	
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 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 300 KB Output is correct
4 Correct 1 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 1 ms 296 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 0 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 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 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 300 KB Output is correct
11 Correct 1 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 1 ms 296 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 296 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 312 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 300 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 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 300 KB Output is correct
11 Correct 1 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 1 ms 296 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 296 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 312 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 300 KB Output is correct
33 Correct 114 ms 37492 KB Output is correct
34 Correct 103 ms 29724 KB Output is correct
35 Correct 48 ms 30068 KB Output is correct
36 Correct 125 ms 37468 KB Output is correct
37 Correct 126 ms 37492 KB Output is correct
38 Correct 121 ms 37616 KB Output is correct
39 Correct 132 ms 36080 KB Output is correct
40 Correct 106 ms 31396 KB Output is correct
41 Correct 105 ms 37552 KB Output is correct
42 Correct 130 ms 31672 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 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 300 KB Output is correct
11 Correct 1 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 1 ms 296 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 296 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 312 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 300 KB Output is correct
33 Correct 114 ms 37492 KB Output is correct
34 Correct 103 ms 29724 KB Output is correct
35 Correct 48 ms 30068 KB Output is correct
36 Correct 125 ms 37468 KB Output is correct
37 Correct 126 ms 37492 KB Output is correct
38 Correct 121 ms 37616 KB Output is correct
39 Correct 132 ms 36080 KB Output is correct
40 Correct 106 ms 31396 KB Output is correct
41 Correct 105 ms 37552 KB Output is correct
42 Correct 130 ms 31672 KB Output is correct
43 Correct 1355 ms 335688 KB Output is correct
44 Correct 1079 ms 302128 KB Output is correct
45 Correct 482 ms 301544 KB Output is correct
46 Correct 1443 ms 329708 KB Output is correct
47 Correct 1352 ms 325800 KB Output is correct
48 Correct 1279 ms 322008 KB Output is correct
49 Correct 1270 ms 344724 KB Output is correct
50 Correct 1179 ms 318848 KB Output is correct
51 Correct 1342 ms 347528 KB Output is correct
52 Correct 1205 ms 321288 KB Output is correct