oj.uz

Submission #834042

# Submission time Handle Problem Language Result Execution time Memory
834042 2023-08-22T10:20:36 Z finn__ Packing Biscuits (IOI20_biscuits) C++17
0 / 100
 1000 ms 340 KB 
#include "biscuits.h"
#include <memory.h>

using L = long long;

constexpr int N = 128;

L a[N], x;

int dfs(size_t i = 0, L z = 0)
{
    if (!(a[i] + z))
        return 1;
    int ans = dfs(i + 1, (a[i] + z) >> 1);
    if (a[i] + z >= x)
        ans += dfs(i + 1, (a[i] + z - x) >> 1);
    return ans;
}

L count_tastiness(L x_, std::vector<L> a_)
{
    x = x_;
    memset(a, 0, sizeof a);
    copy(a_.begin(), a_.end(), a);
    return dfs();
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 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 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1056 ms 212 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1079 ms 340 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

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