Submission #804927

#	Time	Username	Problem	Language	Result	Execution time	Memory
804927		alvingogo	Packing Biscuits (IOI20_biscuits)	C++14	42 / 100	1069 ms	23944 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;
typedef long long ll;

ll count_tastiness(ll x, vector<ll> a) {
	int n=a.size();
	map<ll,ll> dp;
	for(int i=0;i<100;i++){
		a.push_back(0);
	}
	dp[0]=1;
	for(int i=0;i<n+100;i++){
		map<ll,ll> dp2;
		for(auto h:dp){
			dp2[h.fs/2+a[i]]+=h.sc;
			if(h.fs>=x){
				dp2[(h.fs-x)/2+a[i]]+=h.sc;
			}
		}
		dp.swap(dp2);
	}
	ll ans=0;
	for(auto h:dp){
		ans+=h.sc;
	}
	return ans;
}

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