Submission #824075

# Submission time Handle Problem Language Result Execution time Memory
824075 2023-08-13T13:05:34 Z drdilyor Packing Biscuits (IOI20_biscuits) C++17
0 / 100
1000 ms 18616 KB
#include<bits/stdc++.h>
#include "biscuits.h"
using namespace std;
using ll = long long;

const int T = 120;
long long count_tastiness(long long x, std::vector<long long> a) {
    int k = a.size();
    int ans = 0;
    int sum = 0;
    for (int i = 0; i < k; i++)
        sum += a[i] << i;

    for (int y = 0; y <= sum / x; y++) {
        auto b = a;
        vector<int> done(x, 0);
        for (int i = k-1; i >= 0; i--) {
            for (int j = 0; j < x; j++) {
                while (done[j] + (1 << i) <= y && b[i]) {
                    b[i]--;
                    done[j] += (1 << i);
                }
            }
        }
        bool ok = true;
        for (int i : done) ok &= i == y;
        ans += ok;
    }
    return ans;
}

# Verdict Execution time Memory Grader output
1 Execution timed out 1076 ms 212 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1071 ms 212 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1037 ms 212 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1073 ms 18616 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1076 ms 212 KB Time limit exceeded
2 Halted 0 ms 0 KB -