oj.uz

Submission #355593

# Submission time Handle Problem Language Result Execution time Memory
355593 2021-01-22T19:02:28 Z doowey Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 102 ms 1388 KB 
#include <bits/stdc++.h>
#include "biscuits.h"

using namespace std;

typedef long long ll;

vector<ll> a;
map<ll,ll> dp;
ll x;

ll solve(ll n){ // how many <= n
    if(n < 0) return 0;
    if(n == 0) return 1;
    if(dp.count(n)) return dp[n];
    ll lg = 0;
    while((1ll<<(lg+1)) <= n) lg ++ ;
    ll sol = solve((1ll<<lg)-1); // last bit not included
    ll sum = 0;
    for(int i = 0 ; i <= lg; i ++ ){
        sum += (1ll << i) * 1ll * a[i];
    }
    sol += solve(min(sum/x,n)-(1ll<<lg));
    dp[n]=sol;
    return dp[n];
}

ll count_tastiness(ll _x, vector<ll> _a) {
    a = _a;
    x = _x;
    dp.clear();
    while(a.size() < 64) a.push_back(0);
	return solve((1ll<<61));
}

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 492 KB Output is correct
2 Correct 31 ms 1260 KB Output is correct
3 Correct 32 ms 1260 KB Output is correct
4 Correct 31 ms 1260 KB Output is correct
5 Correct 30 ms 1388 KB Output is correct
6 Correct 37 ms 1132 KB Output is correct
7 Correct 39 ms 1260 KB Output is correct
8 Correct 34 ms 1252 KB Output is correct
9 Correct 34 ms 1260 KB Output is correct
10 Correct 25 ms 1260 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 492 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 2 ms 364 KB Output is correct
35 Correct 2 ms 364 KB Output is correct
36 Correct 2 ms 364 KB Output is correct
37 Correct 12 ms 492 KB Output is correct
38 Correct 31 ms 1260 KB Output is correct
39 Correct 32 ms 1260 KB Output is correct
40 Correct 31 ms 1260 KB Output is correct
41 Correct 30 ms 1388 KB Output is correct
42 Correct 37 ms 1132 KB Output is correct
43 Correct 39 ms 1260 KB Output is correct
44 Correct 34 ms 1252 KB Output is correct
45 Correct 34 ms 1260 KB Output is correct
46 Correct 25 ms 1260 KB Output is correct
47 Correct 14 ms 492 KB Output is correct
48 Correct 35 ms 1336 KB Output is correct
49 Correct 16 ms 512 KB Output is correct
50 Correct 25 ms 1260 KB Output is correct
51 Correct 19 ms 1388 KB Output is correct
52 Correct 10 ms 492 KB Output is correct
53 Correct 17 ms 1260 KB Output is correct
54 Correct 102 ms 1260 KB Output is correct
55 Correct 92 ms 1260 KB Output is correct
56 Correct 81 ms 1260 KB Output is correct
57 Correct 65 ms 1388 KB Output is correct