Submission #303839

#	Time	Username	Problem	Language	Result	Execution time	Memory
303839		cgiosy	Packing Biscuits (IOI20_biscuits)	C++17	0 / 100	1 ms	384 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
using ll=long long;

ll count_tastiness(ll x, vector<ll> A) {
	const int N=A.size();
	for(int i=1; i<N; i++) A[i]=A[i-1]+(A[i]<<i);
	for(int i=0; i<N; i++) A[i]=min(A[i]/x, (1LL<<i+1)-1);
	for(int i=1; i<N; i++) A[i]=min(A[i], A[i-1]|(A[i]&1LL<<i));

	ll mx=1;
	vector<ll> D(N, 1);
	for(int i=0; i<N; i++) {
		ll mx2=mx;
		for(int j=0; j<N; j++) if(A[j]&1LL<<i) mx2=max(mx2, D[j]+=mx);
		mx=mx2;
	}
	return mx;
}

Compilation message (stderr)

biscuits.cpp: In function 'll count_tastiness(ll, std::vector<long long int>)':
biscuits.cpp:9:49: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
    9 |  for(int i=0; i<N; i++) A[i]=min(A[i]/x, (1LL<<i+1)-1);
      |                                                ~^~

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