제출 #479251

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
479251		khoabright	Packing Biscuits (IOI20_biscuits)	C++17	9 / 100	1167 ms	1051156 KiB

biscuits

#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 
 
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);
    }
 
    vector<ll> A;
    A.push_back(0);
 
    rep(i, 1, 60) {
        ll mx = s[i - 1] / x;
        ll base = (1ll << (i - 1));
        
        //cout<<"i,base,mx="<<i<<' '<<base<<' '<<mx<<'\n';
        for (int j = 0; base + A[j] <= mx; ++j) {
            if (base + A[j] >= (1ll << i)) break;
            //cout<<"val="<<base+A[j]<<'\n';
            A.push_back(base + A[j]);
        }
    }
 
    // rep(i, 0, A.size() - 1) cout << A[i] << ' ';
    // cout << '\n';
    return A.size();
}

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