Submission #429082

#	Time	Username	Problem	Language	Result	Execution time	Memory
429082		abdzag	Packing Biscuits (IOI20_biscuits)	C++17	0 / 100	2 ms	332 KiB

biscuits

#include<bits/stdc++.h>
#include<unordered_map>
#include<unordered_set>
#include "biscuits.h"
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
#define rrep(i,a,b) for(int i=int(a);i>int(b);i--)
#define trav(a,v) for(auto& a: v)
#define sz(v) v.size()
#define all(v) v.begin(),v.end()
#define vi vector<int>

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const long long inf = 2e9;

using namespace std;

long long count_tastiness(long long x, std::vector<long long> a) {
	ll ans = 0;
	while (a.size() < 70) {
		a.push_back(0);
	}
	rep(i, 0, a.size()) {
		if (a[i]) {
			ans++;
			a[i]--;
			a[i + 1] += a[i] / 2;
		}
	}
	ll res = 1;
	rep(i, 0, ans)res *= 2;
	return res;
}

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