답안 #335541

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
335541	2020-12-13T03:21:03 Z	aanastasov	비스킷 담기 (IOI20_biscuits)	C++17	100 / 100	33 ms	1004 KB

biscuits

#include "biscuits.h"
 
#include <cassert>
//#include <iostream>
 
typedef long long int64_t;
 
int64_t count_tastiness(int64_t numGroups, std::vector<int64_t> initialCount) {
    while (initialCount.size() < 62) initialCount.push_back(0);
    int64_t spareCount = 0;
    auto numWays = std::vector<int64_t>{1};
    for (int64_t i = 0; i < initialCount.size(); ++i) {
        if (initialCount[i] + spareCount >= numGroups) {
            spareCount = spareCount + initialCount[i] - numGroups;
            assert(spareCount >= 0);
            numWays.push_back(numWays.back() * 2);
        } else {
            int64_t maxPossible = 0;
            int64_t availableQty = 0;
            for (int64_t j = 0; j <= i; ++j) availableQty += initialCount[j] << j;
            int64_t borrowedQty = 0;
            for (int64_t j = i; j >= 0; --j) {
                assert(availableQty >= borrowedQty);
                assert((borrowedQty % (1LL << j)) == 0);
                int64_t curCount = initialCount[j];
                if ((curCount << j) <= borrowedQty) {
                    borrowedQty -= curCount << j;
                    availableQty -= curCount << j;
                    curCount = 0;
                } else {
                    curCount -= borrowedQty >> j;
                    availableQty -= borrowedQty;
                    borrowedQty = 0;
                }
                assert(curCount >= 0 && curCount <= initialCount[j]);
                if (((availableQty - borrowedQty) >> j) < numGroups) {
                    availableQty -= curCount << j;
                    continue;
                }
                borrowedQty += numGroups << j;
                borrowedQty = std::max(0LL, borrowedQty - (curCount << j));
                availableQty -= curCount << j;
                maxPossible |= 1LL << j;
            }
            assert(borrowedQty == 0);
            int64_t curWays = 0;
            for (int64_t j = 0; j < i + 1; ++j) {
                if (((maxPossible + 1) & (1LL << j)) > 0) curWays += numWays[j];
            }
            numWays.push_back(curWays);
            spareCount = 0;
        }
        spareCount >>= 1LL;
    }
    return numWays.back();
}

Compilation message

biscuits.cpp: In function 'int64_t count_tastiness(int64_t, std::vector<long long int>)':
biscuits.cpp:12:27: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |     for (int64_t i = 0; i < initialCount.size(); ++i) {
      |                         ~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	256 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	1 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	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	1 ms	512 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct

Subtask #3
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct

Subtask #4
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	19 ms	364 KB	Output is correct
2	Correct	31 ms	876 KB	Output is correct
3	Correct	32 ms	876 KB	Output is correct
4	Correct	33 ms	1004 KB	Output is correct
5	Correct	31 ms	876 KB	Output is correct
6	Correct	29 ms	876 KB	Output is correct
7	Correct	29 ms	876 KB	Output is correct
8	Correct	29 ms	876 KB	Output is correct
9	Correct	29 ms	876 KB	Output is correct
10	Correct	28 ms	876 KB	Output is correct

Subtask #5
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	256 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	1 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	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	0 ms	384 KB	Output is correct
17	Correct	0 ms	256 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	0 ms	256 KB	Output is correct
22	Correct	1 ms	512 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	256 KB	Output is correct
26	Correct	1 ms	256 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	1 ms	384 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	1 ms	256 KB	Output is correct
33	Correct	1 ms	364 KB	Output is correct
34	Correct	1 ms	364 KB	Output is correct
35	Correct	1 ms	364 KB	Output is correct
36	Correct	1 ms	364 KB	Output is correct
37	Correct	19 ms	364 KB	Output is correct
38	Correct	31 ms	876 KB	Output is correct
39	Correct	32 ms	876 KB	Output is correct
40	Correct	33 ms	1004 KB	Output is correct
41	Correct	31 ms	876 KB	Output is correct
42	Correct	29 ms	876 KB	Output is correct
43	Correct	29 ms	876 KB	Output is correct
44	Correct	29 ms	876 KB	Output is correct
45	Correct	29 ms	876 KB	Output is correct
46	Correct	28 ms	876 KB	Output is correct
47	Correct	22 ms	364 KB	Output is correct
48	Correct	14 ms	876 KB	Output is correct
49	Correct	13 ms	492 KB	Output is correct
50	Correct	14 ms	748 KB	Output is correct
51	Correct	25 ms	876 KB	Output is correct
52	Correct	17 ms	364 KB	Output is correct
53	Correct	24 ms	748 KB	Output is correct
54	Correct	27 ms	876 KB	Output is correct
55	Correct	30 ms	876 KB	Output is correct
56	Correct	32 ms	876 KB	Output is correct
57	Correct	33 ms	876 KB	Output is correct

답안 #335541

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