Submission #782588

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
782588	2023-07-14T06:15:20 Z	NothingXD	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	465 ms	201944 KB

boxes

#include "boxes.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef complex<ld> point;

void debug_out(){cerr << endl;}

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
	cerr << H << ' ';
	debug_out(T...);
}

#define debug(...) cerr << "(" << #__VA_ARGS__ << "): ", debug_out(__VA_ARGS__)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define MP(x, y) make_pair(x, y)

const int maxn = 1e7 + 10;

int n, k, l;
ll part[maxn], rpart[maxn];

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

	n = N;
	k = K;
	l = L;

	for (int i = 0; i < n; i++){
		part[i] = min(l, 2 * p[i]);
		if (i >= k) part[i] += part[i-k];
	}

	for (int i = n-1; ~i; i--){
		rpart[i] = min(l, 2 * (l - p[i]));
		if (i + k < n) rpart[i] += rpart[i+k];
	}

	ll ans = min(rpart[0], part[n-1]);
	for (int i = 0; i < n-1; i++){
		ans = min(ans, part[i] + rpart[i+1]);
	}

    return ans;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	320 KB	Output is correct
3	Correct	1 ms	308 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	324 KB	Output is correct
6	Correct	1 ms	324 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	308 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	320 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	340 KB	Output is correct

Subtask #3
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 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	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	1 ms	212 KB	Output is correct
2	Correct	1 ms	320 KB	Output is correct
3	Correct	1 ms	308 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	324 KB	Output is correct
6	Correct	1 ms	324 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	308 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	320 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	340 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 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	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	320 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	320 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	308 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	320 KB	Output is correct
3	Correct	1 ms	308 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	324 KB	Output is correct
6	Correct	1 ms	324 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	308 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	320 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	340 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 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	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	320 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	320 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	308 KB	Output is correct
33	Correct	47 ms	22632 KB	Output is correct
34	Correct	18 ms	21752 KB	Output is correct
35	Correct	20 ms	22220 KB	Output is correct
36	Correct	48 ms	22592 KB	Output is correct
37	Correct	47 ms	22580 KB	Output is correct
38	Correct	47 ms	22688 KB	Output is correct
39	Correct	40 ms	22672 KB	Output is correct
40	Correct	24 ms	22676 KB	Output is correct
41	Correct	48 ms	22684 KB	Output is correct
42	Correct	28 ms	22584 KB	Output is correct

Subtask #6
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	320 KB	Output is correct
3	Correct	1 ms	308 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	324 KB	Output is correct
6	Correct	1 ms	324 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	308 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	320 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	340 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 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	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	320 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	320 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	308 KB	Output is correct
33	Correct	47 ms	22632 KB	Output is correct
34	Correct	18 ms	21752 KB	Output is correct
35	Correct	20 ms	22220 KB	Output is correct
36	Correct	48 ms	22592 KB	Output is correct
37	Correct	47 ms	22580 KB	Output is correct
38	Correct	47 ms	22688 KB	Output is correct
39	Correct	40 ms	22672 KB	Output is correct
40	Correct	24 ms	22676 KB	Output is correct
41	Correct	48 ms	22684 KB	Output is correct
42	Correct	28 ms	22584 KB	Output is correct
43	Correct	440 ms	201944 KB	Output is correct
44	Correct	170 ms	196972 KB	Output is correct
45	Correct	196 ms	197376 KB	Output is correct
46	Correct	428 ms	201060 KB	Output is correct
47	Correct	427 ms	201200 KB	Output is correct
48	Correct	443 ms	201028 KB	Output is correct
49	Correct	377 ms	200172 KB	Output is correct
50	Correct	230 ms	197552 KB	Output is correct
51	Correct	465 ms	200020 KB	Output is correct
52	Correct	232 ms	197556 KB	Output is correct

Submission #782588

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 10.0 / 10.0

Subtask #3 15.0 / 15.0

Subtask #4 15.0 / 15.0

Subtask #5 20.0 / 20.0

Subtask #6 30.0 / 30.0

Subtask #1
10.0 / 10.0

Subtask #2
10.0 / 10.0

Subtask #3
15.0 / 15.0

Subtask #4
15.0 / 15.0

Subtask #5
20.0 / 20.0

Subtask #6
30.0 / 30.0