Submission #303267

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
303267	2020-09-20T06:50:59 Z	model_code	Packing Biscuits (IOI20_biscuits)	C++17	100 / 100	22 ms	928 KB

biscuits

// biscuits-likai-ac
#include "biscuits.h"
#include <vector>

using namespace std;

long long count_tastiness(long long X, std::vector<long long> A) {
    int K = 63;
    while (A.size() < 63) A.push_back(0);
    
    vector<long long> MEM(K); //number of solutions in range [0..2^i-1]
    vector<long long> PTH(K); //previous thresholds
    
    long long CURSUM = 0;
    for (int i = 0; i < K; i++) {
		if (i) CURSUM += A[i - 1] * (1LL << (i - 1));
		
		MEM[i] = 0;
		long long CTH = CURSUM / X; //maximum possible solution
		PTH[i] = CTH;
		
		if (i == 0) {
			MEM[i] = 1;
			continue;
		}
		
		for (int j = i - 1; j >= 0; j--) {
			if (j == 0) { //special case: 0 or 1
				if (CTH >= 1) MEM[i] += 2;
				else MEM[i] += 1;
			}
			else if (CTH >= (1LL << (j + 1))) { //threshold is bigger than entire range
				MEM[i] += 2LL * MEM[j];
				break;
			}
			else if (CTH >= (1LL << j)) { //threshold is bigger than half the range
				MEM[i] += MEM[j];
				CTH = min(CTH - (1LL << j), PTH[j]);
			}
			else CTH = min(CTH, PTH[j]);
		}
	}
	
	return MEM[K - 1];
}

Subtask #1
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	0 ms	256 KB	Output is correct
13	Correct	1 ms	256 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 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	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	1 ms	256 KB	Output is correct
13	Correct	1 ms	256 KB	Output is correct

Subtask #4
35.0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	11 ms	384 KB	Output is correct
2	Correct	19 ms	928 KB	Output is correct
3	Correct	20 ms	888 KB	Output is correct
4	Correct	22 ms	768 KB	Output is correct
5	Correct	19 ms	768 KB	Output is correct
6	Correct	19 ms	768 KB	Output is correct
7	Correct	19 ms	768 KB	Output is correct
8	Correct	19 ms	768 KB	Output is correct
9	Correct	19 ms	896 KB	Output is correct
10	Correct	18 ms	768 KB	Output is correct

Subtask #5
23.0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	0 ms	256 KB	Output is correct
13	Correct	1 ms	256 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	0 ms	256 KB	Output is correct
17	Correct	0 ms	256 KB	Output is correct
18	Correct	0 ms	256 KB	Output is correct
19	Correct	0 ms	256 KB	Output is correct
20	Correct	1 ms	256 KB	Output is correct
21	Correct	0 ms	256 KB	Output is correct
22	Correct	1 ms	256 KB	Output is correct
23	Correct	0 ms	256 KB	Output is correct
24	Correct	1 ms	256 KB	Output is correct
25	Correct	0 ms	256 KB	Output is correct
26	Correct	0 ms	256 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	256 KB	Output is correct
29	Correct	1 ms	256 KB	Output is correct
30	Correct	1 ms	256 KB	Output is correct
31	Correct	1 ms	256 KB	Output is correct
32	Correct	0 ms	256 KB	Output is correct
33	Correct	1 ms	256 KB	Output is correct
34	Correct	1 ms	256 KB	Output is correct
35	Correct	1 ms	256 KB	Output is correct
36	Correct	1 ms	256 KB	Output is correct
37	Correct	11 ms	384 KB	Output is correct
38	Correct	19 ms	928 KB	Output is correct
39	Correct	20 ms	888 KB	Output is correct
40	Correct	22 ms	768 KB	Output is correct
41	Correct	19 ms	768 KB	Output is correct
42	Correct	19 ms	768 KB	Output is correct
43	Correct	19 ms	768 KB	Output is correct
44	Correct	19 ms	768 KB	Output is correct
45	Correct	19 ms	896 KB	Output is correct
46	Correct	18 ms	768 KB	Output is correct
47	Correct	9 ms	384 KB	Output is correct
48	Correct	15 ms	896 KB	Output is correct
49	Correct	8 ms	384 KB	Output is correct
50	Correct	14 ms	768 KB	Output is correct
51	Correct	20 ms	896 KB	Output is correct
52	Correct	10 ms	384 KB	Output is correct
53	Correct	18 ms	640 KB	Output is correct
54	Correct	21 ms	888 KB	Output is correct
55	Correct	20 ms	888 KB	Output is correct
56	Correct	20 ms	896 KB	Output is correct
57	Correct	20 ms	896 KB	Output is correct

Submission #303267

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 12.0 / 12.0

Subtask #3 21.0 / 21.0

Subtask #4 35.0 / 35.0

Subtask #5 23.0 / 23.0

Subtask #1
9.0 / 9.0

Subtask #2
12.0 / 12.0

Subtask #3
21.0 / 21.0

Subtask #4
35.0 / 35.0

Subtask #5
23.0 / 23.0