제출 #402952

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
402952		phathnv	Packing Biscuits (IOI20_biscuits)	C++14	100 / 100	76 ms	1324 KiB

biscuits

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

ll x, s[61];
map<ll, ll> mp[61];

ll Calc(int bit, ll n){
    if (n < 1)
        return 0;
    if (bit == -1)
        return 1;
    n = min(n, min((ll) 2 << bit, s[bit] / x + 1));
    if (mp[bit].count(n))
        return mp[bit][n];
    ll res = 0;
    res = Calc(bit - 1, n - ((ll) 1 << bit)) + Calc(bit - 1, n);
    mp[bit][n] = res;
    return res;
}

long long count_tastiness(long long _x, std::vector<long long> a) {
    x = _x;
    for(int i = 0; i <= 60; i++){
        s[i] = 0;
        if (i < (int) a.size())
            s[i] = a[i] * ((ll) 1 << i);
        if (i)
            s[i] += s[i - 1];
        mp[i].clear();
    }
    return Calc(60, (ll) 1 << 60);
}

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