oj.uz

Submission #397191

# Submission time Handle Problem Language Result Execution time Memory
397191 2021-05-01T17:09:10 Z rocks03 Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 38 ms 1292 KB 
//#pragma GCC target("avx2")
//#pragma GCC optimization("O3")
//#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int N = 60;
ll x;
vector<ll> a;

unordered_map<ll, ll> memo;
ll f(ll n){
    if(n == 0) return 1;
    if(memo[n]) return memo[n];
    ll& ans = memo[n];
    int hbit = 63 - __builtin_clzll(n);
    ll max_y = min(a[hbit] / x, n);
    if(max_y >= (1ll << hbit)){
        ans += f(max_y - (1ll << hbit));
    }
    ans += f((1ll << hbit) - 1);
    return ans;
}

long long count_tastiness(long long X, vector<long long> A){
    while(SZ(A) < N) A.pb(0);
    rep(i, 0, N) A[i] = A[i] * (1ll << i);
    rep(i, 1, N) A[i] += A[i - 1];
    x = X; a = A;
    memo.clear();
    return f(a.back());
}

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 332 KB Output is correct
2 Correct 20 ms 1200 KB Output is correct
3 Correct 20 ms 1204 KB Output is correct
4 Correct 18 ms 1100 KB Output is correct
5 Correct 18 ms 1100 KB Output is correct
6 Correct 21 ms 1124 KB Output is correct
7 Correct 21 ms 1100 KB Output is correct
8 Correct 20 ms 1156 KB Output is correct
9 Correct 20 ms 1160 KB Output is correct
10 Correct 17 ms 1152 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 308 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 304 KB Output is correct
37 Correct 5 ms 332 KB Output is correct
38 Correct 20 ms 1200 KB Output is correct
39 Correct 20 ms 1204 KB Output is correct
40 Correct 18 ms 1100 KB Output is correct
41 Correct 18 ms 1100 KB Output is correct
42 Correct 21 ms 1124 KB Output is correct
43 Correct 21 ms 1100 KB Output is correct
44 Correct 20 ms 1156 KB Output is correct
45 Correct 20 ms 1160 KB Output is correct
46 Correct 17 ms 1152 KB Output is correct
47 Correct 9 ms 332 KB Output is correct
48 Correct 20 ms 1292 KB Output is correct
49 Correct 10 ms 336 KB Output is correct
50 Correct 18 ms 1176 KB Output is correct
51 Correct 15 ms 1280 KB Output is correct
52 Correct 6 ms 332 KB Output is correct
53 Correct 16 ms 1156 KB Output is correct
54 Correct 38 ms 1164 KB Output is correct
55 Correct 37 ms 1172 KB Output is correct
56 Correct 34 ms 1100 KB Output is correct
57 Correct 35 ms 1204 KB Output is correct