제출 #1207635

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

biscuits

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


long long p[128],h[64];
long long ans,nd,b[128];

void dfs(int i,long long x)
{
    ans++;
    vector<long long> y(128);
    if(i!=-1)y[i]=x;
    for(int k=i+1; k<=120; k++)
    {
        if(k)y[k]=y[k-1]/2;
        y[k]+=b[k];
    }

    for(int j=i+1; j<=120; j++)
    {
        if(y[j]>=nd)
            dfs(j,y[j]-nd);
    }
}


long long count_tastiness(long long x, std::vector<long long> a)
{
    memset(b,0,sizeof(b));
    for(int i=0;i<a.size();i++)
        b[i]=a[i];
    nd=x;
    ans=0;
    dfs(-1,0);

    //cout<<ans<<endl;
    ////////////////////

    /*long long sum=0;
    p[0]=1;
    for(long long i=1; i<=125; i++)
    {
        if(1e18/p[i-1]<2)p[i]=1e18+1;
        else p[i]=p[i-1]*2;
        //cout<<p[i]<<endl;
    }
    for(long long i=0;i<a.size();i++)
        sum+=a[i]*p[i];

        //cout<<sum/x<<endl;
    long long ans1=1;
    for(long long g=1;g<=sum/x;g++)
    {
        for(long long i=0;i<a.size();i++)
            h[i]=a[i];
        long long maxx=0,num=0;
        while(num<x)
        {
            long long curr=g;
            for(long long i=a.size()-1;i>=0;i--)
            {
                long long need=min(h[i],curr/p[i]);
                h[i]-=need;
                curr-=need*p[i];
            }
            if(curr!=0)break;
            num++;
        }
        if(num==x)ans1++;
    }
    if(ans1!=ans)
    {
        cout<<x<<endl;
        for(int i=0;i<a.size();i++)
            cout<<a[i]<<" ";
        cout<<endl;
        exit(0);
    }*/

    return ans;
}

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