Submission #836248

# Submission time Handle Problem Language Result Execution time Memory
836248 2023-08-24T09:08:16 Z maomao90 Packing Biscuits (IOI20_biscuits) C++17
42 / 100
1000 ms 40920 KB
// I can do all things through Christ who strengthens me
// Philippians 4:13

#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;

#define REP(i, j, k) for (int i = j; i < (k); i++)
#define RREP(i, j, k) for (int i = j; i >= (k); i--)

template <class T>
inline bool mnto(T &a, const T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T &a, const T b) {return a < b ? a = b, 1 : 0;}

typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define ALL(x) x.begin(), x.end()
#define SZ(x) (int) x.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef tuple<int, int, int> iii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005;
const int MAXK = 62;

int k;
ll x;
vll a;
unordered_map<ll, ll> dp[MAXK];

ll count_tastiness(ll _x, vll _a) {
    x = _x; a = _a;
    k = SZ(a);
    ll sm = 0;
    REP (i, 0, k) {
        sm += a[i] << i;
    }
    if (sm == 0 || x > 1e6) {
        return 1;
    }
    k = 64 - __builtin_clzll(sm);
    a.resize(k, 0);
    REP (i, 0, k) {
        if (a[i] < x) {
            continue;
        }
        ll ex = (a[i] - x) / 2;
        if (i + 1 == k) {
            assert(ex == 0);
            break;
        }
        a[i] -= ex * 2;
        a[i + 1] += ex;
    }
    dp[0][0] = 1;
    REP (i, 1, k + 1) {
        /*
        REP (j, 0, x + 1) {
            dp[i][j] = 0;
        }
        */
        dp[i].clear();
        for (auto [j, v] : dp[i - 1]) {
        //REP (j, 0, x + 1) {
            int ta = a[i - 1] + j;
            //dp[i][ta / 2] += dp[i - 1][j];
            dp[i][ta / 2] += v;
            if (ta >= x) {
                //dp[i][(ta - x) / 2] += dp[i - 1][j];
                dp[i][(ta - x) / 2] += v;
            }
        }
    }
    return dp[k][0];
}

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 33 ms 13940 KB Output is correct
2 Correct 44 ms 7552 KB Output is correct
3 Correct 74 ms 12044 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 149 ms 14308 KB Output is correct
9 Correct 96 ms 10324 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 23 ms 2836 KB Output is correct
13 Correct 187 ms 14284 KB Output is correct
# Verdict Execution time Memory Grader output
1 Execution timed out 1080 ms 40920 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 33 ms 13940 KB Output is correct
25 Correct 44 ms 7552 KB Output is correct
26 Correct 74 ms 12044 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 149 ms 14308 KB Output is correct
32 Correct 96 ms 10324 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 3 ms 596 KB Output is correct
35 Correct 23 ms 2836 KB Output is correct
36 Correct 187 ms 14284 KB Output is correct
37 Execution timed out 1080 ms 40920 KB Time limit exceeded
38 Halted 0 ms 0 KB -