제출 #428434

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
428434		Peti	비스킷 담기 (IOI20_biscuits)	C++14	12 / 100	3 ms	360 KiB

biscuits

#include <bits/stdc++.h>
#include "biscuits.h"

using namespace std;

const int bitc = 60;

long long count_tastiness(long long x, std::vector<long long> a) {
    vector<long long> ossz(bitc, 0), dp(bitc, 0);
    ossz[0] = a[0];
    for(int i = 1; i < (int)a.size(); i++)
        ossz[i] = ossz[i-1] + (1ll<<i)*a[i];
    for(int i = (int)a.size(); i < bitc; i++)
        ossz[i] = ossz[i-1];

    for(int i = 0; i < bitc; i++){
        if(ossz[i] >= (1ll<<i)*x){
            //cout<<ossz[i]<<" ossz------------\n";
            long long c = ossz[i] - (1ll<<i)*x;
            //cout<<"c: "<<c<<"\n";
            for(int j = i-1; j >= 0; j--){
                if(((1ll<<(j+1))-1ll)*x <= c){
                    //cout<<j<<" all good\n";
                    dp[i] += dp[j];
                    break;
                } else if((1ll<<j)*x <= c && ossz[j] >= (1ll<<j)*x){
                    c = min(c, ossz[j]) - (1ll<<j)*x;
                    //cout<<j<<" "<<dp[j-1]+1ll<<" one\n";
                    dp[i] += (j > 0 ? dp[j-1]+1ll : 1ll);
                }
            }
            dp[i] += 1ll;
        }
        //cout<<"dp: "<<dp[i]<<"\n";

        if(i > 0)
            dp[i] += dp[i-1];
    }

	return dp[bitc-1]+1ll;
}

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