oj.uz

Submission #345030

# Submission time Handle Problem Language Result Execution time Memory
345030 2021-01-06T22:25:02 Z pggp Boxes with souvenirs (IOI15_boxes) C++14
100 / 100
 931 ms 311884 KB 
#include <bits/stdc++.h>

using namespace std;

long long delivery(int N, int K, int L, int p[]){
	vector < int > positions;
	for (int i = 0; i < N; ++i)
	{
		positions.push_back(p[i]);
	}

	vector < int > l, r;
	vector < long long > l_dp, r_dp;
	for (int i = 0; i < N; ++i)
	{
		if(positions[i] > L/2){
			r.push_back(positions[i]);
		}
		else{
			l.push_back(positions[i]);
		}
	}
	sort(r.begin(), r.end(), greater < int >());
	l_dp.resize(N + 1);
	r_dp.resize(N + 1);
	for (int i = 0; i < l.size(); ++i)
	{
		if(i >= K){
			l_dp[i] = l_dp[i - K] + l[i];
		}
		else{
			l_dp[i] = l[i];
		}
	}
	for (int i = 0; i < r.size(); ++i)
	{
		if(i >= K){
			r_dp[i] = r_dp[i - K] + (L - r[i]);
		}
		else{
			r_dp[i] = L - r[i];
		}
	}
	//cout << r.size() << " " << l.size() << endl; 
	long long a1, b1;
	a1 = 0;
	b1 = 0;
	if(l.size() > 0){
		a1 = 2 * l_dp[l.size() - 1];
	}
	if(r.size() > 0){
		b1 = 2 * r_dp[r.size() - 1];
	}
	long long ans = a1 + b1;
	//cout << ans << endl;
	for (int i = 1; i < K; ++i)
	{
		//cout << ans << endl;
		long long a, b;

		long long s = l.size() - i - 1;
		if(s < 0){
			a = 0;
		}
		else{
			a = 2 * l_dp[l.size() - i - 1];
		}
		
		long long t = (r.size() - (K - i) - 1);
		//cout << "A = " << t << endl;
		if(t < 0){
			b = 0;
		}
		else{
			//cout << r.size() << endl;
			b = 2 * r_dp[r.size() - (K - i) - 1];
		}
		ans = min(ans, a +  b + L);
	}


	return ans;
}

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:26:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |  for (int i = 0; i < l.size(); ++i)
      |                  ~~^~~~~~~~~~
boxes.cpp:35:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |  for (int i = 0; i < r.size(); ++i)
      |                  ~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 72 ms 30932 KB Output is correct
34 Correct 42 ms 31708 KB Output is correct
35 Correct 46 ms 32216 KB Output is correct
36 Correct 81 ms 28936 KB Output is correct
37 Correct 96 ms 28948 KB Output is correct
38 Correct 77 ms 29908 KB Output is correct
39 Correct 68 ms 31444 KB Output is correct
40 Correct 50 ms 32856 KB Output is correct
41 Correct 86 ms 28884 KB Output is correct
42 Correct 63 ms 30940 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 72 ms 30932 KB Output is correct
34 Correct 42 ms 31708 KB Output is correct
35 Correct 46 ms 32216 KB Output is correct
36 Correct 81 ms 28936 KB Output is correct
37 Correct 96 ms 28948 KB Output is correct
38 Correct 77 ms 29908 KB Output is correct
39 Correct 68 ms 31444 KB Output is correct
40 Correct 50 ms 32856 KB Output is correct
41 Correct 86 ms 28884 KB Output is correct
42 Correct 63 ms 30940 KB Output is correct
43 Correct 787 ms 279776 KB Output is correct
44 Correct 414 ms 292676 KB Output is correct
45 Correct 478 ms 277084 KB Output is correct
46 Correct 686 ms 279012 KB Output is correct
47 Correct 801 ms 311884 KB Output is correct
48 Correct 856 ms 279180 KB Output is correct
49 Correct 747 ms 279388 KB Output is correct
50 Correct 514 ms 278108 KB Output is correct
51 Correct 931 ms 279540 KB Output is correct
52 Correct 623 ms 278352 KB Output is correct