제출 #303886

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
303886		Pajaraja	Packing Biscuits (IOI20_biscuits)	C++17	12 / 100	12 ms	896 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
#define MAXN 67
using namespace std;
long long dp[MAXN],dpu[MAXN],p[MAXN];
long long count_tastiness(long long x, std::vector<long long> a)
{
    while((x<<(1LL*a.size()))<1000000000000000000LL) a.push_back(0);
    int k=a.size();
    p[0]=a[0];
    for(long long i=1;i<k;i++) p[i]=p[i-1]+(a[i]<<i);
    for(long long i=0;i<k;i++)
    {
        long long mx=(p[i]-(x<<i))/x;
        dpu[i]=0;
        if(p[i]>=(x<<i))
        {
            if(mx>=(1LL<<i)) dpu[i]=(i!=0)?dp[i-1]:1;
            else
            {
                bool fas=false;
                for(long long j=i-1;j>=0;j--) if((1LL<<j)&mx)
                {
                    dpu[i]+=(j!=0)?dp[j-1]:1;
                    long long nx=(p[j]-(x<<j))/x;
                    if(p[j]<(x<<j)) {fas=true; break;}
                    mx^=(1LL<<j);
                    if(nx<mx) {dpu[i]+=dpu[j]; fas=true; break;}
                }
                if(!fas) dpu[i]++;
            }
        }
        dp[i]=(i!=0)?dp[i-1]:1;
        dp[i]+=dpu[i];
    }
	return dp[k-1];
}

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