제출 #606734

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

biscuits

    #include <bits/stdc++.h>
    using namespace std;
    typedef long long ll;
    const ll INF = 1e9+7;
    const ll MOD = 998244353;
    typedef pair<ll,ll> ii;
    #define iii pair<ll,ii>
    #define f(i,a,b) for(ll i = a;i < b;i++)
    #define pb push_back
    #define vll vector<ll>
    #define F first
    #define S second
    #define all(x) (x).begin(), (x).end()
    ///I hope I will get uprating and don't make mistakes
    ///I will never stop programming
    ///sqrt(-1) Love C++
    ///Please don't hack me
    ///@TheofanisOrfanou Theo830
    ///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
    ///Stay Calm
    ///Look for special cases
    ///Beware of overflow and array bounds
    ///Think the problem backwards
    ///Training
    #include "biscuits.h"
    long long count_tastiness(long long x, vector<long long> A){
        ll ans = 1;
        ll k = A.size();
        ll a[62] = {0};
        f(i,0,k){
            a[i] = A[i];
        }
        ll pos = 0;
        while(pos < 62){
            if(a[pos] > 0){
                ll posa = a[pos];
                posa /= 2;
                ll sum = a[pos] / x;
                ll extra = a[pos] % x;
                extra /= 2;
                ll f = pos;
                while(posa && sum+1 >= (1LL<<(pos - f))){
                    pos++;
                    extra += a[pos];
                    sum += (extra / x) * (1LL<<(pos - f));
                    extra %= x;
                    posa += a[pos];
                    posa /= 2;
                    extra /= 2;
                }
                ans *= (sum + 1);
            }
            pos++;
        }
        return ans;
    }

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