제출 #1086032

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1086032		steveonalex	비스킷 담기 (IOI20_biscuits)	C++17	100 / 100	12 ms	1456 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

ll count_tastiness(ll x, vector<ll> a) {
    int k = a.size();
    while(a.size() < 60) a.push_back(0);
    k = 60;
    for(int i = 0; i<k; ++i) if (a[i] > x + 1){
        ll diff = (a[i] - x) / 2;
        a[i] -= diff * 2;
        a[i+1] += diff;
    }

    vector<ll> sum(k);
    for(int i = 0; i<k; ++i){
        sum[i] = a[i] << i;
        if (i > 0) sum[i] += sum[i-1];
    }
    for(int i = 0; i<k; ++i) sum[i] /= x;
    for(int i = 0; i<k; ++i) minimize(sum[i], MASK(i + 1) - 1);

    vector<bool> valid(k);
    for(int i = 0; i<k; ++i) valid[i] = sum[i] >= MASK(i);

    ll ans = 1;
    vector<ll> dp(k);
    for(int i = 0; i<k; ++i) if (valid[i]) dp[i] = 1;
    for(int i = k-1; i>=0; --i) if (dp[i]){
        ll cur = dp[i];

        int u = i;
        ll d = sum[i];
        while(u >= 0){
            ans += cur;
            d -= MASK(u);

            int v = -1;
            for(int j = 0; j < u; ++j) {
                if (valid[j] && sum[j] <= d) dp[j] += cur;
                if (d >= MASK(j) && d < sum[j]) v = j; 
            }
            u = v;
        }
    }


    return ans;
}


// int main(void){
//     ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
//     clock_t start = clock();

//     int q; cin >> q;
//     while(q--){
//         int k; ll x; cin >> k >> x;
//         vector<ll> a(k);
//         for(int i = 0; i<k; ++i) cin >> a[i];

//         cout << count_tastiness(x, a) << "\n";
//     }

//     cerr << "Time elapsed: " << clock() - start << " ms\n";
//     return 0;
// }

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