Submission #479242

#	Time	Username	Problem	Language	Result	Execution time	Memory
479242		khoabright	비스킷 담기 (IOI20_biscuits)	C++17	9 / 100	1117 ms	1051132 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] * (1 << i);
    }

    vector<int> 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] >= (1 << i)) break;
            //cout<<"val="<<base+A[j]<<'\n';
            A.push_back(base + A[j]);
            if (j == A.size() - 1) break;
        }
    }

    // rep(i, 0, A.size() - 1) cout << A[i] << ' ';
    // cout << '\n';
    return A.size();
}

// 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';
//     }
// }

Compilation message (stderr)

biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:35:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |             if (j == A.size() - 1) break;
      |                 ~~^~~~~~~~~~~~~~~

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