제출 #335532

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
335532		aanastasov	비스킷 담기 (IOI20_biscuits)	C++17	100 / 100	93 ms	1004 KiB

biscuits

#include "biscuits.h"

#include <cassert>

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 extraQty = 0;
	auto numWays = std::vector<int64_t>{1};
	for (int64_t i = 0; i < initialCount.size(); ++i) {
		if (initialCount[i] + (extraQty >> i) >= numGroups) {
			extraQty += initialCount[i] << i;
			extraQty -= numGroups << i;
			assert(extraQty >= 0);
			numWays.push_back(numWays.back() * 2);
		} else {
			auto counts = std::vector<int64_t>(initialCount.begin(), initialCount.end());
			int64_t maxPossible = 0;
			for (int64_t j = i; j >= 0; --j) {
				int64_t availableQty = 0;
				for (int64_t jj = 0; jj < j + 1; ++jj)
					availableQty += counts[jj] << jj;
				if ((availableQty >> j) < numGroups)
					continue;
				int64_t borrowedQty = numGroups;
				for (int64_t jj = j; jj >= 0; --jj) {
					int64_t takeCount = std::min(borrowedQty, counts[jj]);
					counts[jj] -= takeCount;
					borrowedQty = (borrowedQty - takeCount) * 2;
				}
				maxPossible |= 1LL << j;
			}
			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);
			extraQty = 0;
		}
	}
	return numWays.back();
}

컴파일 시 표준 에러 (stderr) 메시지

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 < initialCount.size(); ++i) {
      |                      ~~^~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 9 / 9
• Subtask 2: 12 / 12
• Subtask 3: 21 / 21
• Subtask 4: 35 / 35
• Subtask 5: 23 / 23