Submission #377920

#	Time	Username	Problem	Language	Result	Execution time	Memory
377920		Thistle	Packing Biscuits (IOI20_biscuits)	C++14	0 / 100	1 ms	364 KiB

biscuits

#include "biscuits.h"
#include <vector>
#include<iostream>
#include<algorithm>
#include<unordered_map>
using namespace std;
using ll=long long;
using H=pair<ll, ll>;
using vi=vector<ll>;
#define rng(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define rep(i,n) rng((i),(0),(n))
#define pb push_back
#define vec vector
#define all(a) (a).begin(),(a).end()
#define fs first
#define sc second
#define siz(a) ll((a).size())


long long count_tastiness(long long x, std::vector<long long> a) {
	ll k=siz(a);
	unordered_map<ll, ll>mp[2];
	//remain cookie -> able number
	mp[0][0]=1;
	rep(i,k){
		auto& now=mp[i&1];
		auto& nxt=mp[(i+1)&1];
		nxt.clear();
		for(auto g:now){
			ll t=g.fs;
			t+=a[i];
			if(t>=x) nxt[(t-x)>>1]+=g.sc;
			nxt[t>>1]+=g.sc;
		}
	}

	ll ans=0;
	for(auto g:mp[k&1]){
		ans+=g.sc;
	}
	return ans;
}

Compilation message (stderr)

biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:10:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define rng(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
      |                            ^
biscuits.cpp:11:18: note: in expansion of macro 'rng'
   11 | #define rep(i,n) rng((i),(0),(n))
      |                  ^~~
biscuits.cpp:25:2: note: in expansion of macro 'rep'
   25 |  rep(i,k){
      |  ^~~

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