oj.uz

Submission #128012

# Submission time Handle Problem Language Result Execution time Memory
128012 2019-07-10T10:26:43 Z Sorting Boxes with souvenirs (IOI15_boxes) C++14
100 / 100
 1084 ms 254280 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 1e7 + 7;
const long long inf = 1e18 + 7;

vector<long long> v1, v2, v3, v4, pr1, pr2;

void output(vector<long long> v){
	for(long long &x: v){
		cout << x << " ";
	}
	cout << endl;
}

long long delivery(int n, int k, int l, int *positions){
	sort(positions, positions + n);
	
	int idx = 0;

	for(; idx < n && positions[idx] <= l / 2; idx++){
		v1.push_back(positions[idx]);
	}
	for(; idx < n; idx++){
		v2.push_back(l - positions[idx]);
	}
	if(!v2.empty()){
		reverse(v2.begin(), v2.end());
	}

	for(int i = 0 ; i < (int)v1.size(); i++){
		if(i >= k){
			pr1.push_back(pr1[i - k] + v1[i] * 2ll);
		}
		else{
			pr1.push_back(v1[i] * 2ll);
		}
	}

	for(int i = 0 ; i < (int)v2.size(); i++){
		if(i >= k){
			pr2.push_back(pr2[i - k] + v2[i] * 2ll);
		}
		else{
			pr2.push_back(v2[i] * 2ll);
		}
	}

	long long ans = 0, sum1 = 0, sum2 = 0;

	for(int i = -1; true;){
		if(i + k >= (int)v1.size()){
			for(++i; i < (int)v1.size(); ++i){
				v3.push_back(v1[i]);
			}
			break;
		}
		i += k;
		sum1 += (long long)v1[i] * 2ll;
	}
	for(int i = -1; true;){
		if(i + k >= (int)v2.size()){
			for(++i; i < (int)v2.size(); ++i){
				v4.push_back(v2[i]);
			}
			break;
		}
		i += k;
		sum2 += (long long)v2[i] * 2ll;
	}


	ans = sum1 + sum2;

	if(v3.empty() || v4.empty()){
		ans = 0;

		if(!v1.empty()){
			ans += pr1.back();
		}
		if(!v2.empty()){
			ans += pr2.back();
		}

		return ans;
	}

	ans = pr1.back() + pr2.back();

	for(int i = v1.size() - 2; i >= -1 && i >= (int)v1.size() - k; i--){
		int j = v2.size() + v1.size() - k - i - 2;

		//cout << i << " " << j << endl;

		long long curr = l;

		if(j > -1){
			curr += pr2[j];
		}
		if(i > -1){
			curr += pr1[i];
		}

		//cout << curr << endl;

		ans = min(ans, curr);
	}

	return ans;
}

/*int positions[N], n, k, l;

int main(){
	cin >> n >> k >> l;
	for(int i = 0; i < n; i++){
		cin >> positions[i];
	}

	cout << delivery(n, k, l, positions) << "\n";

	return 0;
}*/
/*
3 2 8
1 2 5
*/
/*
4 3 20
1 2 3 4
*/

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:91:24: warning: conversion to 'int' from 'std::vector<long long int>::size_type {aka long unsigned int}' may alter its value [-Wconversion]
  for(int i = v1.size() - 2; i >= -1 && i >= (int)v1.size() - k; i--){
              ~~~~~~~~~~^~~
boxes.cpp:92:41: warning: conversion to 'int' from 'std::vector<long long int>::size_type {aka long unsigned int}' may alter its value [-Wconversion]
   int j = v2.size() + v1.size() - k - i - 2;
           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 3 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 97 ms 24664 KB Output is correct
34 Correct 68 ms 26964 KB Output is correct
35 Correct 66 ms 26964 KB Output is correct
36 Correct 99 ms 26900 KB Output is correct
37 Correct 95 ms 30616 KB Output is correct
38 Correct 91 ms 29400 KB Output is correct
39 Correct 95 ms 24656 KB Output is correct
40 Correct 67 ms 24656 KB Output is correct
41 Correct 94 ms 26964 KB Output is correct
42 Correct 68 ms 26964 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 3 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 97 ms 24664 KB Output is correct
34 Correct 68 ms 26964 KB Output is correct
35 Correct 66 ms 26964 KB Output is correct
36 Correct 99 ms 26900 KB Output is correct
37 Correct 95 ms 30616 KB Output is correct
38 Correct 91 ms 29400 KB Output is correct
39 Correct 95 ms 24656 KB Output is correct
40 Correct 67 ms 24656 KB Output is correct
41 Correct 94 ms 26964 KB Output is correct
42 Correct 68 ms 26964 KB Output is correct
43 Correct 1081 ms 223168 KB Output is correct
44 Correct 662 ms 219244 KB Output is correct
45 Correct 745 ms 227100 KB Output is correct
46 Correct 1018 ms 251988 KB Output is correct
47 Correct 912 ms 233532 KB Output is correct
48 Correct 1016 ms 254280 KB Output is correct
49 Correct 1064 ms 227664 KB Output is correct
50 Correct 798 ms 227088 KB Output is correct
51 Correct 1084 ms 254000 KB Output is correct
52 Correct 802 ms 254008 KB Output is correct