제출 #574050

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
574050		keta_tsimakuridze	Packing Biscuits (IOI20_biscuits)	C++14	100 / 100	43 ms	1328 KiB

biscuits

#include "biscuits.h"
#include<bits/stdc++.h>
using namespace std;
#define int long long
int cn[65], sum[65], x;
int solve(int R, int Bit) {
    R = min(R, min((1ll << (Bit + 1)) - 1, sum[Bit] / x));
    if(R < (1ll << Bit)) return 0;
    if(R == (1ll << Bit)) return 1;
    int B = __lg(R - (1ll << Bit));
    return solve(R - (1ll << Bit), B) + (B == 0 ? 1ll :  cn[B - 1]);
}
long long count_tastiness(long long X, std::vector<long long> a) {
    x = X;
    while(a.size() < 60) a.push_back(0);
    for(int i = 0; i <= 59; i++) {
        sum[i] = (1ll << i) * a[i];
        if(i) sum[i] += sum[i - 1];
        if(i) cn[i] = cn[i - 1];
        else cn[i] = 1;
        cn[i] += solve((1ll << (i + 1)) - 1, i);
    }
    return cn[59];
}

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