제출 #616123

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
616123	2022-07-31 22:47:39	Bench0310	비스킷 담기 (IOI20_biscuits)	C++17	100 / 100	60 ms	1332 KiB

biscuits

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
#include <bits/stdc++.h>
#include "biscuits.h"
using namespace std;
typedef long long ll;
ll count_tastiness(ll x,vector<ll> a)
{
    const int L=60;
    while(a.size()<L) a.push_back(0);
    vector<ll> s(L,0);
    for(int i=0;i<L;i++) s[i]=(i>0?s[i-1]:0)+a[i]*(ll(1)<<i);
    map<ll,ll> dp;
    dp[0]=1;
    function<ll(ll)> g=[&](ll n)->ll
    {
        if(n<0) return 0;
        if(dp.find(n)!=dp.end()) return dp[n];
        int i=63-__builtin_clzll(n);
        return (dp[n]=g((ll(1)<<i)-1)+g(min(n-(ll(1)<<i),(s[i]/x-(ll(1)<<i)))));
    };
    return g(s[L-1]);
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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