제출 #1207651

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1207651		simona1230	Packing Biscuits (IOI20_biscuits)	C++20	9 / 100	1100 ms	788516 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;

long long p[64];
long long ans,nd,b[64];
long long s[64];

long long count_tastiness(long long x, std::vector<long long> a)
{
    p[0]=1;
    for(int i=1; i<60; i++)
        p[i]=p[i-1]*2;

    s[0]=a[0];
    for(int i=1; i<60; i++)
    {
        s[i]=s[i-1];
        if(i<a.size())s[i]+=a[i]*p[i];
    }
    nd=x;
    ans=0;
    queue<pair<int,long long> > q;
    q.push({-1,0});
    while(q.size())
    {
        int i=q.front().first;
        long long curr=q.front().second;
        q.pop();
        ans++;
        for(int j=i+1; j<60; j++)
        {
            if(curr+p[j]<=s[j]/nd)
                q.push({j,curr+p[j]});
        }
    }

    return ans;
}

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