제출 #730389

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
730389		danikoynov	비스킷 담기 (IOI20_biscuits)	C++14	0 / 100	2 ms	312 KiB

biscuits

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

using namespace std;
typedef long long ll;

const ll maxk = 63;
ll n, dp[maxk], b[maxk];
long long count_tastiness(long long x, vector<long long> a)
{
    a.resize(maxk);
    n = a.size();


    b[0] = a[0];
    for (int i = 1; i < maxk; i ++)
    {
        b[i] = b[i - 1] / 2 + a[i];
    }

    dp[0] = 1;
   if (a[0] != 0)
        dp[0] ++;
    for (ll i = 1; i < maxk; i ++)
    {
        dp[i] = 0;
        if (b[i] < x)
        {
            ///cout << "here " << i << " " << b[i] << " " << x << endl;
            dp[i] = dp[i - 1];
            continue;
        }

        dp[i] = dp[i - 1];
        if (a[i] >= x)
        {
            dp[i] += dp[i - 1];
            continue;
        }
        ll nec = (x - a[i]) * 2;
        for (int j = i - 1; j >= 0; j --)
        {
            ///cout << i << " : " << j << " : " << nec << " : " << a[j] << endl;
            if (a[j] >= nec + x)
            {
                dp[i] = dp[i] + dp[j];
                break;
            }
            if (a[j] >= nec)
            {
                if (j == 0)
                    dp[i] ++;
                else
                    dp[i] = dp[i] + dp[j - 1];
                nec = (x - (a[j] - nec)) * 2;
            }
            else
            {
                nec = (nec - a[j]) * 2;
            }
        }
    }
    //for (int j = 0; j < 5; j ++)
      //  cout << dp[j] << " ";
    //cout << endl;

    return dp[maxk - 1];
}

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