제출 #409097

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
409097		priority_queue	비스킷 담기 (IOI20_biscuits)	C++14	0 / 100	57 ms	1220 KiB

biscuits

#include <bits/stdc++.h>

#define forint(i, N) for (long long i = 0; i < (N); i++)

using namespace std;

unordered_map<long long, long long> m;

long long count(long long x, vector<long long>& a, long long max_y) {

	if (m[max_y] != 0) {
		return m[max_y];
	}

	if (max_y == 0) {
		m[0] = 1;
		return 1;
	}

	if (max_y == 1) {
		if (a[0] >= x) {
			m[1] = 2;
			return 2; // 0 & 1;
		}
		else {
			m[1] = 1;
			return 1; // 0 only 
		}
	}

	long long k = a.size();
	vector<long long> sum(61, 0);

	sum[0] = a[0];
	for (long long i = 1; i < k; i++) {
		sum[i] = sum[i - 1] + a[i] * (1ll << i);
	}

	for (long long i = k; i < 61; i++) {
		sum[i] = sum[i-1];
	}

	long long i = 0;
	while ((1ll << i) < max_y) {
		i++;
	}

	long long aa = count(x, a, 1ll << (i-1));

	if (sum[i-1] /  (1ll << (i-1)) <  x ) { 		
		m[max_y] = aa;
		return m[max_y];
	}
	else {
		m[max_y] = aa + count(x, a, min(max_y - (1ll << (i-1)), sum[i-1]/x - (1ll << (i-1)))) - 1; // (1ll << (i-1)) double counted 
		return  m[max_y];
	}
 }


long long count_tastiness(long long x, vector<long long> a) {
	m.clear();
	return count(x, a, 1e18);
}

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