Submission #696083

#	Time	Username	Problem	Language	Result	Execution time	Memory
696083		garam1732	Packing Biscuits (IOI20_biscuits)	C++14	21 / 100	99 ms	1356 KiB

biscuits

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

typedef long long ll;
priority_queue<ll> pq;
ll cnt[100];

long long count_tastiness(long long x, std::vector<long long> a) {
	if(x == 1) {
        for(int i = (int)a.size()-1; i > 0; i--) if(a[i-1]) a[i-1] += 2*a[i], a[i] = 0;

        ll res = 1;
        for(ll x : a) res *= (x+1);
        return res;
	}

	while(a.size() > 17) a.pop_back();
	if(x > 100000) return 1;

	ll ans = 1;
	for(int v = 1; v <= 100000/x; v++) {
        while(pq.size()) pq.pop();
        for(int i = 0; i < x; i++) pq.push(v);

        vector<ll> b = a;
        for(int i = (int)b.size()-1; i >= 0; i--) {
            while(b[i] && pq.size() && pq.top() >= (1<<i)) {
                ll y = pq.top(); pq.pop();
                int z = min(b[i], y/(1<<i));
                b[i] -= z, y -= z*(1<<i);
                if(y) pq.push(y);
            }
        }

        if(pq.empty()) ans++;
	}

	return ans;
}

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