답안 #335530

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
335530 2020-12-13T01:51:11 Z aanastasov 비스킷 담기 (IOI20_biscuits) C++17
100 / 100
97 ms 1028 KB
#include "biscuits.h"

#include <cassert>

typedef long long int64_t;

int64_t count_tastiness(int64_t x, std::vector<int64_t> a) {
	while (a.size() < 62) a.push_back(0);
	int64_t extra = 0;
	auto ways = std::vector<int64_t>{1};
	for (int64_t i = 0; i < a.size(); ++i) {
		if (a[i] + (extra >> i) >= x) {
			extra += (1LL << i) * a[i];
			extra -= (1LL << i) * x;
			assert(extra >= 0);
			ways.push_back(ways.back() * 2);
		} else {
			auto counts = std::vector<int64_t>(a.begin(), a.end());
			int64_t upper_bound = 0;
			for (int64_t j = i; j >= 0; --j) {
				int64_t available = 0;
				for (int64_t jj = 0; jj < j + 1; ++jj)
					available += counts[jj] * (1LL << jj);
				if ((available >> j) < x)
					continue;
				
				int64_t needed = x;
				for (int64_t jj = j; jj >= 0; --jj) {
					int64_t am = std::min(needed, counts[jj]);
					counts[jj] -= am;
					needed = (needed - am) * 2;
				}
				upper_bound |= 1LL << j;
			}
			int64_t res = 0;
			upper_bound++;
			for (int64_t j = 0; j < i + 1; ++j)
				if ((upper_bound & (1LL << j)) > 0)
					res += ways[j];
			ways.push_back(res);
			extra = 0;
		}
	}
	return ways.back();
}

Compilation message

biscuits.cpp: In function 'int64_t count_tastiness(int64_t, std::vector<long long int>)':
biscuits.cpp:11:24: 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]
   11 |  for (int64_t i = 0; i < a.size(); ++i) {
      |                      ~~^~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 256 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
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 368 KB Output is correct
3 Correct 1 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 1 ms 256 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
# 결과 실행 시간 메모리 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 256 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
# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 492 KB Output is correct
2 Correct 81 ms 876 KB Output is correct
3 Correct 86 ms 1024 KB Output is correct
4 Correct 97 ms 876 KB Output is correct
5 Correct 82 ms 876 KB Output is correct
6 Correct 79 ms 1028 KB Output is correct
7 Correct 79 ms 876 KB Output is correct
8 Correct 80 ms 884 KB Output is correct
9 Correct 81 ms 876 KB Output is correct
10 Correct 81 ms 1004 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 256 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 1 ms 368 KB Output is correct
17 Correct 1 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 1 ms 256 KB Output is correct
22 Correct 1 ms 364 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 256 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 67 ms 492 KB Output is correct
38 Correct 81 ms 876 KB Output is correct
39 Correct 86 ms 1024 KB Output is correct
40 Correct 97 ms 876 KB Output is correct
41 Correct 82 ms 876 KB Output is correct
42 Correct 79 ms 1028 KB Output is correct
43 Correct 79 ms 876 KB Output is correct
44 Correct 80 ms 884 KB Output is correct
45 Correct 81 ms 876 KB Output is correct
46 Correct 81 ms 1004 KB Output is correct
47 Correct 83 ms 492 KB Output is correct
48 Correct 27 ms 876 KB Output is correct
49 Correct 50 ms 364 KB Output is correct
50 Correct 31 ms 748 KB Output is correct
51 Correct 81 ms 1004 KB Output is correct
52 Correct 67 ms 496 KB Output is correct
53 Correct 69 ms 748 KB Output is correct
54 Correct 85 ms 876 KB Output is correct
55 Correct 90 ms 876 KB Output is correct
56 Correct 90 ms 876 KB Output is correct
57 Correct 94 ms 876 KB Output is correct