oj.uz

Submission #805256

# Submission time Handle Problem Language Result Execution time Memory
805256 2023-08-03T14:36:07 Z becaido Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 12 ms 852 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;

#ifndef WAIMAI
#include "biscuits.h"
#endif

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout(T t, U...u) {cout << t << (sizeof...(u) ? ", " : ""), dout(u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

ll count_tastiness(ll x, vector<ll> a) {
    ll ans = 0;
    a.resize(64);
    vector<ll> sum(64), dp(64);
    sum[0] = a[0];
    FOR (i, 1, 63) sum[i] = sum[i - 1] + (a[i] << i);
    /*unordered_map<ll, ll> mp[64];
    auto rec = [&](auto rec, int i, ll cur)->ll {
        if (i < 0) return 1;
        if (mp[i].count(cur)) return mp[i][cur];
        ll tot = 0;
        cur = min(cur, sum[i]);
        tot += rec(rec, i - 1, cur);
        if ((cur >> i) >= x) tot += rec(rec, i - 1, cur - (x << i));
        return mp[i][cur] = tot;
    };
    return rec(rec, 63, sum[63]);*/
    FOR (i, 0, 63) {
        ll cur = sum[i];
        for (int j = i - 1; j >= 0; j--) {
            cur = min(cur, sum[j]);
            if ((cur >> j) >= x) {
                dp[i] += dp[j];
                cur -= x << j;
            }
        }
        dp[i]++;
    }
    return dp[63];
}

/*
in1
2
3 3
5 2 1
3 2
2 1 2
out1
5
6
*/

#ifdef WAIMAI
int main() {
    int q;
    assert(scanf("%d", &q) == 1);
    vector<int> k(q);
    vector<ll> x(q);
    vector<vector<ll>> a(q);
    vector<ll> results(q);
    for (int t = 0; t < q; t++) {
        assert(scanf("%d%lld", &k[t], &x[t]) == 2);
        a[t] = vector<ll>(k[t]);
        for (int i = 0; i < k[t]; i++) {
            assert(scanf("%lld", &a[t][i]) == 1);
        }
    }
    fclose(stdin);

    for (int t = 0; t < q; t++) {
        results[t] = count_tastiness(x[t], a[t]);
    }
    for (int t = 0; t < q; t++) {
        printf("%lld\n", results[t]);
    }
    fclose(stdout);
    return 0;
}
#endif

Compilation message

biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:27:8: warning: unused variable 'ans' [-Wunused-variable]
   27 |     ll ans = 0;
      |        ^~~

Subtask #1
9.0 / 9.0

# 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 0 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 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 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

Subtask #3
21.0 / 21.0

# 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 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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 340 KB Output is correct
2 Correct 9 ms 772 KB Output is correct
3 Correct 9 ms 724 KB Output is correct
4 Correct 9 ms 724 KB Output is correct
5 Correct 9 ms 724 KB Output is correct
6 Correct 9 ms 852 KB Output is correct
7 Correct 9 ms 828 KB Output is correct
8 Correct 11 ms 724 KB Output is correct
9 Correct 9 ms 724 KB Output is correct
10 Correct 8 ms 724 KB Output is correct

Subtask #5
23.0 / 23.0

# 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 0 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 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 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 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 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 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 4 ms 340 KB Output is correct
38 Correct 9 ms 772 KB Output is correct
39 Correct 9 ms 724 KB Output is correct
40 Correct 9 ms 724 KB Output is correct
41 Correct 9 ms 724 KB Output is correct
42 Correct 9 ms 852 KB Output is correct
43 Correct 9 ms 828 KB Output is correct
44 Correct 11 ms 724 KB Output is correct
45 Correct 9 ms 724 KB Output is correct
46 Correct 8 ms 724 KB Output is correct
47 Correct 5 ms 340 KB Output is correct
48 Correct 9 ms 724 KB Output is correct
49 Correct 5 ms 340 KB Output is correct
50 Correct 9 ms 724 KB Output is correct
51 Correct 7 ms 724 KB Output is correct
52 Correct 3 ms 340 KB Output is correct
53 Correct 7 ms 732 KB Output is correct
54 Correct 12 ms 788 KB Output is correct
55 Correct 11 ms 828 KB Output is correct
56 Correct 11 ms 724 KB Output is correct
57 Correct 11 ms 796 KB Output is correct