oj.uz

Submission #306114

# Submission time Handle Problem Language Result Execution time Memory
306114 2020-09-24T14:29:38 Z MrDomino Packing Biscuits (IOI20_biscuits) C++14
0 / 100
 1 ms 384 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

ll x;
vector<ll> a;
vector<ll> limit;
int n;
int sol;

void bkt(int i, ll sum)
{
    if (i == n)
    {
        sol++;
        return;
    }
    if (sum <= limit[i])
    {
        bkt(i + 1, sum);
    }
    if (sum + x * (1LL << i) <= limit[i])
    {
        bkt(i + 1, sum + x * (1LL << i));
    }
}

ll count_tastiness(ll xx, vector<ll> aa)
{
    sol = 0;
    x = xx;
    a = aa;
    n = (int) a.size();
    limit = a;
    ll c = 0;
    for (int i = 0; i < n; i++)
    {
        c += (1LL << i) * a[i];
        limit[i] = c;
    }
    bkt(0, 0);
    return sol;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -