제출 #479307

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
479307		khoabright	비스킷 담기 (IOI20_biscuits)	C++17	0 / 100	2 ms	332 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
 
//#define int long long 
#define ff first
#define ss second
#define pii pair<int, int>
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for (int i = (int)a; i <= (int)b; ++i)
#define rep1(i, a, b) for (int i = (int)a; i >= (int)b; --i)
#define mp make_pair
#define vii vector<vector<int>>
#define ll long long 
 
unordered_map<ll, ll> g;
 
ll cal_g(ll n, ll x, vector<ll> &s) {
    if (n <= 0) return 0;
    if (n == 1) return 1;
 
    ll &tmp = g[n];
    if (tmp > 0) return tmp;
 
    int i = __lg(n - 1);
 
    tmp = cal_g(1ll << i, x, s) + cal_g(min(n, 1 + s[i] / x) - (1ll << i), x, s); 
    return tmp;
}
 
ll count_tastiness(ll x, vector<ll> a) {
    while (a.size() < 61) a.push_back(0);
    vector<ll> s(61);
    rep(i, 0, 60) {
        if (i) s[i] = s[i - 1];
        s[i] += a[i] * (1ll << i);
    }
 
    return cal_g(s[60] + 1, x, s);
}
 
// int main() {
//     ios_base::sync_with_stdio(0);
//     cin.tie(0); //cout.tie(0);
//     int t; cin >> t;
//     while(t--){
//         long long x, k;
//         vector<long long> v;
//         cin >> k >> x;
//         v.resize(k);
//         rep(i, 0, k - 1) {
//             cin >> v[i];
//         }
//         cout << count_tastiness(x, v) << '\n';
//     }
// }

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