oj.uz

Submission #311646

# Submission time Handle Problem Language Result Execution time Memory
311646 2020-10-10T21:09:53 Z andrew Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 83 ms 1016 KB 
#include <bits/stdc++.h>
#include <biscuits.h>

#define fi first
#define se second
#define p_b push_back
#define m_p make_pair
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()

using namespace std;
typedef long long ll;
typedef pair <ll, ll> pll;
typedef pair <int, int> pii;

ll count_tastiness(ll x, vector <ll> a){
    ll ans = 0;
    vector <ll> b, c;
    ll _now = 0;
    for(int i = 0; i < sz(a) || _now; i++){
        c.p_b(_now);
        if(i < sz(a))_now += a[i];
        b.p_b(_now % 2);
        _now /= 2;
    }
    map <ll, ll> dp[63];
    dp[62][0] = 1;
    while(sz(b) < 63)b.p_b(0);
    while(sz(c) < 63)c.p_b(0);
    ll xt, t;
    for(int i = 61; i >= 0; i--){
        for(auto j : dp[i + 1]){
            xt = j.fi + b[i];
            if(xt >= x){
                dp[i][min(min(2 * x, (xt - x) * 2), 2 * c[i])] += j.se;
            }
            dp[i][min(min(2 * x, xt * 2), 2 * c[i])] += j.se;
        }
    }
    ans = 0;
    for(auto j : dp[0])ans += j.se;
    return ans;
}

Compilation message

biscuits.cpp: In function 'll count_tastiness(ll, std::vector<long long int>)':
biscuits.cpp:30:12: warning: unused variable 't' [-Wunused-variable]
   30 |     ll xt, t;
      |            ^

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 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 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 308 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 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 256 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 256 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 384 KB Output is correct
2 Correct 28 ms 908 KB Output is correct
3 Correct 27 ms 916 KB Output is correct
4 Correct 28 ms 896 KB Output is correct
5 Correct 27 ms 900 KB Output is correct
6 Correct 37 ms 896 KB Output is correct
7 Correct 36 ms 896 KB Output is correct
8 Correct 31 ms 908 KB Output is correct
9 Correct 34 ms 1016 KB Output is correct
10 Correct 28 ms 896 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 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 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 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 308 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 1 ms 256 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 0 ms 256 KB Output is correct
27 Correct 1 ms 256 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 360 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 8 ms 384 KB Output is correct
38 Correct 28 ms 908 KB Output is correct
39 Correct 27 ms 916 KB Output is correct
40 Correct 28 ms 896 KB Output is correct
41 Correct 27 ms 900 KB Output is correct
42 Correct 37 ms 896 KB Output is correct
43 Correct 36 ms 896 KB Output is correct
44 Correct 31 ms 908 KB Output is correct
45 Correct 34 ms 1016 KB Output is correct
46 Correct 28 ms 896 KB Output is correct
47 Correct 9 ms 384 KB Output is correct
48 Correct 21 ms 896 KB Output is correct
49 Correct 11 ms 384 KB Output is correct
50 Correct 19 ms 768 KB Output is correct
51 Correct 17 ms 896 KB Output is correct
52 Correct 10 ms 384 KB Output is correct
53 Correct 16 ms 728 KB Output is correct
54 Correct 83 ms 896 KB Output is correct
55 Correct 74 ms 896 KB Output is correct
56 Correct 71 ms 896 KB Output is correct
57 Correct 52 ms 916 KB Output is correct