Submission #1011723

# Submission time Handle Problem Language Result Execution time Memory
1011723 2024-07-01T07:32:32 Z pawned Boxes with souvenirs (IOI15_boxes) C++17
100 / 100
794 ms 282236 KB
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")

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

#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;

ll delivery(int n, int kg, int lg, int p[]) {
	ll N = n; ll K = kg; ll L = lg;
	// length is L, have N teams, distribute K at a time
	ll cut = L / 2;
	vi leftv;	// [0, cut]
	vi rightv;	// [cut + 1, L - 1];
	sort(p, p + N);
	for (int i = 0; i < N; i++) {
		if (p[i] <= cut)
			leftv.pb(p[i]);
		else
			rightv.pb(L - p[i]);
	}
	sort(leftv.begin(), leftv.end());
	sort(rightv.begin(), rightv.end());
/*	cout<<"leftv: ";
	for (ll x : leftv)
		cout<<x<<" ";
	cout<<endl;
	cout<<"rightv: ";
	for (ll x : rightv)
		cout<<x<<" ";
	cout<<endl;*/
	int X = (int)(leftv.size());
	int Y = (int)(rightv.size());
	vi pfs1(X + 1, 0);	// sum of all alternating by K, end at i - 1
	vi pfs2(Y + 1, 0);
	for (int i = 1; i <= X; i++) {
		if (i - 1 < K)
			pfs1[i] = leftv[i - 1];
		else
			pfs1[i] = pfs1[i - K] + leftv[i - 1];
	}
	for (int i = 1; i <= Y; i++) {
		if (i - 1 < K)
			pfs2[i] = rightv[i - 1];
		else
			pfs2[i] = pfs2[i - K] + rightv[i - 1];
	}
/*	cout<<"pfs1: ";
	for (ll x : pfs1)
		cout<<x<<" ";
	cout<<endl;
	cout<<"pfs2: ";
	for (ll x : pfs2)
		cout<<x<<" ";
	cout<<endl;*/
	ll mincost = 2 * (pfs1[X] + pfs2[Y]);
	for (int i = 1; i < K; i++) {	// count remove in left
		if (X < i || Y < (K - i))
			continue;
		ll cost = L + 2 * (pfs1[X - i] + pfs2[Y - (K - i)]);
		mincost = min(mincost, cost);
	}
	return mincost;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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 0 ms 444 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 444 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 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 344 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 360 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 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
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 444 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 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 344 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 360 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 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 Correct 70 ms 29000 KB Output is correct
34 Correct 37 ms 22856 KB Output is correct
35 Correct 41 ms 22984 KB Output is correct
36 Correct 64 ms 29000 KB Output is correct
37 Correct 63 ms 28900 KB Output is correct
38 Correct 74 ms 29516 KB Output is correct
39 Correct 69 ms 27716 KB Output is correct
40 Correct 52 ms 23616 KB Output is correct
41 Correct 73 ms 28844 KB Output is correct
42 Correct 44 ms 23748 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 444 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 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 344 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 360 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 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 Correct 70 ms 29000 KB Output is correct
34 Correct 37 ms 22856 KB Output is correct
35 Correct 41 ms 22984 KB Output is correct
36 Correct 64 ms 29000 KB Output is correct
37 Correct 63 ms 28900 KB Output is correct
38 Correct 74 ms 29516 KB Output is correct
39 Correct 69 ms 27716 KB Output is correct
40 Correct 52 ms 23616 KB Output is correct
41 Correct 73 ms 28844 KB Output is correct
42 Correct 44 ms 23748 KB Output is correct
43 Correct 788 ms 281092 KB Output is correct
44 Correct 374 ms 213996 KB Output is correct
45 Correct 436 ms 220360 KB Output is correct
46 Correct 672 ms 282044 KB Output is correct
47 Correct 653 ms 282216 KB Output is correct
48 Correct 651 ms 282236 KB Output is correct
49 Correct 724 ms 268976 KB Output is correct
50 Correct 474 ms 228348 KB Output is correct
51 Correct 794 ms 282028 KB Output is correct
52 Correct 487 ms 230716 KB Output is correct