Submission #413507

#	Time	Username	Problem	Language	Result	Execution time	Memory
413507		mosiashvililuka	Packing Biscuits (IOI20_biscuits)	C++17	0 / 100	1105 ms	525804 KiB

biscuits

#include "biscuits.h"
#include<bits/stdc++.h>
using namespace std;
long long a,b,c,d,e,i,j,ii,jj,zx,xc,f[209],x,S[209],JM,xr[209],E,jm;
long long tes,te;
vector <long long> v;
long long count_tastiness(long long Xx, std::vector<long long> A) {
	x=Xx;
	a=A.size();a--;
	for(i=0; i<=a; i++){
		f[i]=A[i];
	}
	xr[0]=1;
	for(i=1; i<=62; i++){
		xr[i]=xr[i-1]*2;
	}
	for(i=0; i<=a; i++){
		jm+=f[i]*xr[i];
	}
	v.clear();
	v.push_back(0);
	JM=0;
	for(i=0; i<=a+134; i++){
		JM+=f[i]*xr[i];
		if(xr[i]>jm) break;
		S[i]=JM;
		E=v.size();
		for(j=0; j<E; j++){
			//if(x*(xr[i]+v[j])>S[i]) continue;
			if((xr[i]+v[j])>S[i]/x) continue;
			v.push_back(xr[i]+v[j]);
		}
	}
	return v.size();
}


/*int main(){
	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>tes;
	for(te=1; te<=tes; te++){
	cin>>a>>x;
	vector <long long> A;
	for(i=0; i<a; i++){
		cin>>c;
		A.push_back(c);
	}
	cout<<count_tastiness(x,A)<<endl;
	}
	return 0;
}*/

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