제출 #398289

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
398289		Everule	Packing Biscuits (IOI20_biscuits)	C++14	0 / 100	1 ms	332 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
long long count_tastiness(long long x, std::vector<long long> a) {
	int k = a.size();
    vector<ll> dp(k);
    vector<ll> pdp(k+1);
    vector<ll> psum(k+1);
    for(int i=1;i<=k;i++){
        psum[i] = psum[i-1] + a[i-1] * (1ll<<(i-1));
    }
    for(int i=0;i<k;i++){
        dp[i] = ((psum[i+1] / (1ll<<i) / x) != 0);
        ll sum = psum[i+1] - (1ll<<i) * x;
        ll mx = sum / x;
        mx = min(mx, (1ll<<i) - 1);
        for(int j=i-1,s=0;j>=0;--j){
            if(mx & (1ll<<j)){
                dp[i] += pdp[j] + s;
                sum = min(psum[j+1], sum);
                sum -= (1ll<<j) * x;
                mx = sum / x;
                mx = min(mx, (1ll<<j) - 1);
                s |= 1;
            }
        }
        pdp[i+1] = pdp[i] + dp[i];
    }
    //for(auto &x : dp) cout<<x<<" ";
    //cout<<"\n";
    return pdp[k] + 1;
}

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