Submission #1292863

#	Time	Username	Problem	Language	Result	Execution time	Memory
1292863		enzy	Packing Biscuits (IOI20_biscuits)	C++20	9 / 100	1129 ms	821268 KiB

biscuits

#include "biscuits.h"
#include<bits/stdc++.h>
#pragma GCC optimize("O3,Ofast")
#pragma GCC target("avx2,sse4")
#define ll long long
using namespace std;
const int maxk=62;
vector<pair<ll,ll>>dp[maxk];
ll count_tastiness(ll x, vector<ll> v){
	for(int i=0;i<maxk;i++) dp[i].clear();
	reverse(v.begin(),v.end());
	v.push_back(0);
	reverse(v.begin(),v.end());
	while(v.size()<=61) v.push_back(0);
	ll resp=1;
	dp[0].push_back({1,0});
	for(int i=1;i<=60;i++){
		for(int j=0;j<i;j++){
			for(pair<ll,ll>p : dp[j]){
				ll sum=p.second; // qnt terei de i para pagar
				for(int l=j+1;l<=i;l++){
					sum/=2;
					sum+=v[l];
				}
				if(sum>=x){
					dp[i].push_back({p.first,(sum-x)});
					resp+=p.first;
				}
			}
		}
	}
	return resp;
}

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