제출 #615609

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
615609	2022-07-31 11:10:11	alirezasamimi100	비스킷 담기 (IOI20_biscuits)	C++17	100 / 100	46 ms	1316 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
25
26
27
28
29
30
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int k=60;
ll x;
vector<ll> ps(k);
map<ll,ll> mp;
ll calc(ll t){
    if(t<=0) return 0;
    if(mp.count(t)) return mp[t];
    int i=0;
    ll y=1;
    for(; y<t; i++,y<<=1);
    i--;
    return calc(1ll<<i)+calc(min(t,ps[i]/x+1)-(1ll<<i));
}
ll count_tastiness(ll x, vector<ll> a) {
    ::x=x;
    a.resize(k);
    ps[0]=a[0];
    mp.clear();
    for(int i=1; i<k; i++) ps[i]=(a[i]<<i)+ps[i-1];
    mp[1]=1;
    for(int i=1; i<=k; i++) mp[1ll<<i]=calc(1ll<<i);
    return mp[1ll<<k];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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