제출 #306111

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

biscuits

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

bool check(ll y, ll x, vector<ll> a)
{
    /// can I form the number y x times???
    int n = (int) a.size();
    if (log2(y) >= n)
    {
        return 0;
    }
    ll have = 0;
    ll need = 0;
    for (int i = 0; i < n; i++)
    {
        have += a[i] * (1LL << i);
        if (y & (1LL << i))
        {
            need += x * (1LL << i);
        }
        if (have < need)
        {
            return 0;
        }
    }
    return 1;
}

ll count_tastiness(ll x, vector<ll> a)
{
    ll sol = 0;
    for (ll y = 0; y <= (ll) 5e5; y++)
    {
        sol += check(y, x, a);
    }
    return sol;
}

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