제출 #1309306

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1309306		zzzzzzzzzzzzzzz	Packing Biscuits (IOI20_biscuits)	C++20	100 / 100	34 ms	984 KiB

biscuits

#include "biscuits.h"

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

vector<unordered_map<ll,ll>> dp;
vector<ll> a2,li;
ll x2;

ll solve(ll idx, ll n){
	if(n<0) return 0;
	if(idx<0) return 1ll;
	if(dp[idx].find(n)!=dp[idx].end()) return dp[idx][n];
	return dp[idx][n]=solve(idx-1,min(min(n,(1ll<<idx)-1),li[idx]))+solve(idx-1,min(min(n-(1ll<<idx),(1ll<<idx)-1),li[idx]-(1ll<<idx)));
}

ll count_tastiness(ll x, vector<ll> a) {
	dp.clear();a2.clear();li.clear();
	dp.resize(61);a2.resize(61);
	x2=x;
	ll s=0;
	for(int i=0;i<61;i++){
		if(i<a.size()) s+=a[i]<<i;
		li.push_back(s/x);
	}
	solve(60,(1ll<<61ll)-1ll);
	return dp[60][(1ll<<61ll)-1ll];
}

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