제출 #308303

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
308303		bruce_test	비스킷 담기 (IOI20_biscuits)	C++14	9 / 100	1188 ms	1389464 KiB

biscuits

#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define lc (rt<<1)
#define rc (rt<<1|1)
#define pb push_back
#define cl(a, b) memset(a, b, sizeof(a))
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<int, pi> pii;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pi> vii;
typedef vector<pii> viii;
const int inf = 0x3F3F3F3F;
const ll infl = 0x3F3F3F3F3F3F3F3FLL;
const int mod = 1e9 + 7, LOG=60;
ll cnt, psa[LOG]; map<ll, ll> mp;
ll fun(ll x){
    if(x < 0) return 0;
    if(x == 0) return 1LL;
    if(mp.count(x)) return mp[x];
    int p = 63 - __builtin_clzll(x);
    ll tmp = fun((1<<p)-1) + fun(min(x, psa[p]/cnt) - (1<<p));
    return mp[x]=tmp;
}
ll count_tastiness(ll x, vl a){
    a.resize(LOG); cnt = x; mp.clear();
    psa[0] = a[0];
    for(int i=1; i<LOG; i++) psa[i] = psa[i-1] + a[i]*(1LL<<i);
    return fun((1LL<<LOG) - 1);
}
//int main(){
//    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
//    vl a = {5, 2, 1};
//    cout << count_tastiness(3, a) << endl;
//}

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