oj.uz

Submission #782580

# Submission time Handle Problem Language Result Execution time Memory
782580 2023-07-14T06:01:51 Z _martynas Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 26 ms 1340 KB 
#include "biscuits.h"
#include <set>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <map>

using namespace std;

using ll = long long;

#warning change mxk to 60
const int mxk = 60;

unordered_map<ll, ll> memo;
ll solve(ll n, ll x, vector<ll> &pref) {
    if(n == 1) return 1;
    if(n <= 0) return 0;
    if(memo.count(n)) return memo[n];
    ll val = 0;
    int msb = 63-__builtin_clzll(n-1);
    val += solve(1LL<<msb, x, pref);
    val += solve(min(n, 1+pref[msb]/x)-(1LL<<msb), x, pref);
    memo[n] = val;
    return val;
}


ll count_tastiness(ll x, vector<ll> a) {
    memo.clear();
    vector<ll> pref(mxk);
    a.resize(mxk, 0);
    for(int i = 0; i < mxk; i++) {
        pref[i] = (1LL<<i)*a[i]+(i?pref[i-1]:0);
    }
    ll ans = solve(1LL<<mxk, x, pref);
	return ans;
}

Compilation message

biscuits.cpp:12:2: warning: #warning change mxk to 60 [-Wcpp]
   12 | #warning change mxk to 60
      |  ^~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 340 KB Output is correct
2 Correct 13 ms 1108 KB Output is correct
3 Correct 12 ms 1108 KB Output is correct
4 Correct 14 ms 1144 KB Output is correct
5 Correct 15 ms 1196 KB Output is correct
6 Correct 12 ms 1144 KB Output is correct
7 Correct 13 ms 1160 KB Output is correct
8 Correct 12 ms 1156 KB Output is correct
9 Correct 12 ms 1116 KB Output is correct
10 Correct 12 ms 1100 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 304 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 300 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 5 ms 340 KB Output is correct
38 Correct 13 ms 1108 KB Output is correct
39 Correct 12 ms 1108 KB Output is correct
40 Correct 14 ms 1144 KB Output is correct
41 Correct 15 ms 1196 KB Output is correct
42 Correct 12 ms 1144 KB Output is correct
43 Correct 13 ms 1160 KB Output is correct
44 Correct 12 ms 1156 KB Output is correct
45 Correct 12 ms 1116 KB Output is correct
46 Correct 12 ms 1100 KB Output is correct
47 Correct 7 ms 340 KB Output is correct
48 Correct 15 ms 1236 KB Output is correct
49 Correct 9 ms 340 KB Output is correct
50 Correct 14 ms 1108 KB Output is correct
51 Correct 10 ms 1340 KB Output is correct
52 Correct 5 ms 340 KB Output is correct
53 Correct 9 ms 1088 KB Output is correct
54 Correct 26 ms 1076 KB Output is correct
55 Correct 25 ms 1192 KB Output is correct
56 Correct 21 ms 1212 KB Output is correct
57 Correct 18 ms 1224 KB Output is correct