oj.uz

Submission #304831

# Submission time Handle Problem Language Result Execution time Memory
304831 2020-09-22T00:59:19 Z 2qbingxuan Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 347 ms 1528 KB 
#include <bits/stdc++.h>
#ifdef local
#define safe std::cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(...) qqbx(#__VA_ARGS__, __VA_ARGS__)
template <typename H, typename ...T> void qqbx(const char*s, const H &h, T ...args) {
    for(; *s && *s != ','; ++s) if(*s != ' ') std::cerr << *s;
    std::cerr << " = " << h << (sizeof...(T) ? ", " : "\n");
    if constexpr (sizeof...(T)) qqbx(++s, args...);
}
#else
#include "biscuits.h"
#define debug(...) ((void)0)
#define safe ((void)0)
#endif // local
#define pb emplace_back

using namespace std;
typedef long long ll;
const int N = 2500025;

ll count_tastiness(ll x, vector<ll> a) {
    int k = a.size();
    cerr << x << '\n';
    for(int i = 0; i < k; i++) cerr << a[i] << (i+1==k ? '\n' : ' ');
    vector<ll> sum(k);
    sum[0] = a[0];
    for(int i = 1; i < k; i++) sum[i] = sum[i-1] + (a[i] << i);
    for(int i = 0; i < k; i++) sum[i] /= x;
    /* for(int i = 0; i < k; i++) sum[i] = min(sum[i], ((1LL<<i+1)-1)); */
#if 0
    int ans = 0;
    for(int y = 0; y <= sum[k-1]; y++) {
        bool ok = 1;
        int yf = 0;
        for(int i = 0; i < k; i++) {
            yf += y & (1LL << i);
            if(yf > sum[i]) ok = 0;
        }
        if(ok) ++ans;
    }
#else
    k = 60;
    sum.resize(k, sum.back());
    vector<map<ll,ll>> mp(k);
    // count how many y, \forall i, (y & (11...11)) <= lim
    function<ll(int,ll)> calc = [&](int i, ll lim) -> ll {
        if(lim < 0) return 0;
        if(lim > sum[i]) lim = sum[i];
        if(lim > ((1LL<<i+1)-1)) lim = ((1LL<<i+1)-1);
        if(i == 0) return lim + 1;
        if(mp[i].count(lim)) return mp[i][lim];
        if(lim >= (1LL>>i))
            return mp[i][lim] = calc(i-1, lim-(1LL<<i)) + calc(i-1, lim);
        return mp[i][lim] = calc(i-1, lim);
    };
    ll ans = calc(k-1, sum[k-1]);
#endif // 0
    debug(ans);
    return ans;
}

#ifdef local
signed main() {
    count_tastiness(3, {5, 2, 1});
    count_tastiness(2, {2, 1, 2});
    count_tastiness(1, {0, 2});
}
#endif // local

Compilation message

biscuits.cpp: In lambda function:
biscuits.cpp:49:26: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   49 |         if(lim > ((1LL<<i+1)-1)) lim = ((1LL<<i+1)-1);
      |                         ~^~
biscuits.cpp:49:48: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   49 |         if(lim > ((1LL<<i+1)-1)) lim = ((1LL<<i+1)-1);
      |                                               ~^~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 288 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 1 ms 288 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 384 KB Output is correct
2 Correct 301 ms 1272 KB Output is correct
3 Correct 304 ms 1272 KB Output is correct
4 Correct 304 ms 1400 KB Output is correct
5 Correct 301 ms 1440 KB Output is correct
6 Correct 305 ms 1144 KB Output is correct
7 Correct 309 ms 1144 KB Output is correct
8 Correct 309 ms 1144 KB Output is correct
9 Correct 303 ms 1272 KB Output is correct
10 Correct 290 ms 1272 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 288 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 3 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 1 ms 288 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 3 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 4 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 3 ms 384 KB Output is correct
34 Correct 4 ms 384 KB Output is correct
35 Correct 4 ms 384 KB Output is correct
36 Correct 4 ms 384 KB Output is correct
37 Correct 18 ms 384 KB Output is correct
38 Correct 301 ms 1272 KB Output is correct
39 Correct 304 ms 1272 KB Output is correct
40 Correct 304 ms 1400 KB Output is correct
41 Correct 301 ms 1440 KB Output is correct
42 Correct 305 ms 1144 KB Output is correct
43 Correct 309 ms 1144 KB Output is correct
44 Correct 309 ms 1144 KB Output is correct
45 Correct 303 ms 1272 KB Output is correct
46 Correct 290 ms 1272 KB Output is correct
47 Correct 21 ms 384 KB Output is correct
48 Correct 290 ms 1528 KB Output is correct
49 Correct 25 ms 504 KB Output is correct
50 Correct 223 ms 1176 KB Output is correct
51 Correct 280 ms 1400 KB Output is correct
52 Correct 20 ms 384 KB Output is correct
53 Correct 220 ms 1272 KB Output is correct
54 Correct 346 ms 1272 KB Output is correct
55 Correct 347 ms 1400 KB Output is correct
56 Correct 339 ms 1400 KB Output is correct
57 Correct 332 ms 1400 KB Output is correct