oj.uz

Submission #976776

# Submission time Handle Problem Language Result Execution time Memory
976776 2024-05-07T06:09:35 Z Amaarsaa Boxes with souvenirs (IOI15_boxes) C++14
50 / 100
 41 ms 25640 KB 
#include<bits/stdc++.h>
#include "boxes.h"
using namespace std;
using ll = long long ;

ll delivery(int N, int K, int L, int p[]) {
	ll ans, cnt_ard, cnt_urd, res;
	vector < ll > ard, urd;
	ll cnt = 0, i, j, r, s;
	for (i = 0; i < N; i ++) {
		if (p[i] == 0) continue;
		if ( p[i] * 2 > L) {
			ard.push_back(p[i]);
		}
		else {
			if (p[i] * 2 < L) urd.push_back(p[i]);
			else cnt ++;
		}
	}
	ll Ard = 0, A = 0;
	ll Urd = 0, U = 0;
	ans = 0;
	reverse(ard.begin(), ard.end());
	for (i = urd.size() - 1; i >= 0; i -= K) U += urd[i];
	j = i + K;
	for (i = ard.size() - 1; i >= 0; i -= K) A += (L - ard[i]);
	r = i + K;
	for (i = K - 1; i < urd.size(); i += K) Urd += (urd[i]);
	for (i = K - 1; i < ard.size(); i += K) Ard += ( L - ard[i]);
//	cout << ans << endl;
	cnt_urd = j + 1;
	cnt_ard = r + 1;
	U *= 2;
	A *= 2;
	Urd *= 2;
	Ard*= 2;
//	cout << cnt_urd << " " << cnt_ard << endl;
//	cout << U << " " << A << endl;
//	cout << Urd << " " << Ard << endl;
	res = ((cnt_ard + cnt_urd + cnt + K - 1) / K) * L;
	res = res + Urd + Ard;
//	cout << res << endl;
	if ( cnt_ard != 0) {
		res = min(res, ((Urd + A+ ((cnt_urd + cnt + K - 1)/K) * L) ));
	}
//	cout << res << endl;
	if ( cnt_urd != 0) {
		res = min(res, (( U + Ard+ ((cnt_ard + cnt + K - 1)/K) * L) ));
	}
//	cout << res << endl;
	if ( cnt_ard != 0 && cnt_urd != 0) {
		res = min(res, ((A + U+ ((cnt + K - 1)/K) * L) ));
	}
	
	return res;
	
}

Compilation message

boxes.cpp: In function 'll delivery(int, int, int, int*)':
boxes.cpp:28:20: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |  for (i = K - 1; i < urd.size(); i += K) Urd += (urd[i]);
      |                  ~~^~~~~~~~~~~~
boxes.cpp:29:20: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |  for (i = K - 1; i < ard.size(); i += K) Ard += ( L - ard[i]);
      |                  ~~^~~~~~~~~~~~
boxes.cpp:7:5: warning: variable 'ans' set but not used [-Wunused-but-set-variable]
    7 |  ll ans, cnt_ard, cnt_urd, res;
      |     ^~~
boxes.cpp:9:23: warning: unused variable 's' [-Wunused-variable]
    9 |  ll cnt = 0, i, j, r, s;
      |                       ^

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 756 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Incorrect 41 ms 25640 KB Output isn't correct
34 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 756 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Incorrect 41 ms 25640 KB Output isn't correct
34 Halted 0 ms 0 KB -