oj.uz

Submission #308304

# Submission time Handle Problem Language Result Execution time Memory
308304 2020-09-30T21:54:43 Z bruce_test Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 87 ms 1020 KB 
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define lc (rt<<1)
#define rc (rt<<1|1)
#define pb push_back
#define cl(a, b) memset(a, b, sizeof(a))
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<int, pi> pii;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pi> vii;
typedef vector<pii> viii;
const int inf = 0x3F3F3F3F;
const ll infl = 0x3F3F3F3F3F3F3F3FLL;
const int mod = 1e9 + 7, LOG=60;
ll cnt, psa[LOG]; map<ll, ll> mp;
ll fun(ll x){
    if(x < 0) return 0;
    if(mp.count(x)) return mp[x];
    if(x == 0) return mp[0]=1LL;
    int p = 63 - __builtin_clzll(x);
    mp[x] = fun((1LL<<p)-1) + fun(min(x, psa[p]/cnt) - (1LL<<p));
    return mp[x];
}
ll count_tastiness(ll x, vl a){
    a.resize(LOG); cnt = x; mp.clear();
    psa[0] = a[0];
    for(int i=1; i<LOG; i++) psa[i] = psa[i-1] + a[i]*(1LL<<i);
    return fun((1LL<<LOG) - 1);
}
//int main(){
//    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
//    vl a = {5, 2, 1};
//    cout << count_tastiness(3, a) << endl;
//}

Subtask #1
9.0 / 9.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 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 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 1 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 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 384 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 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 0 ms 256 KB Output is correct
2 Correct 1 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 384 KB Output is correct
7 Correct 1 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 384 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 9 ms 384 KB Output is correct
2 Correct 29 ms 880 KB Output is correct
3 Correct 31 ms 1020 KB Output is correct
4 Correct 28 ms 896 KB Output is correct
5 Correct 28 ms 896 KB Output is correct
6 Correct 34 ms 896 KB Output is correct
7 Correct 35 ms 896 KB Output is correct
8 Correct 31 ms 896 KB Output is correct
9 Correct 31 ms 896 KB Output is correct
10 Correct 23 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 1 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 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 1 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 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 384 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 0 ms 256 KB Output is correct
25 Correct 1 ms 256 KB Output is correct
26 Correct 1 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 384 KB Output is correct
30 Correct 1 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 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 9 ms 384 KB Output is correct
38 Correct 29 ms 880 KB Output is correct
39 Correct 31 ms 1020 KB Output is correct
40 Correct 28 ms 896 KB Output is correct
41 Correct 28 ms 896 KB Output is correct
42 Correct 34 ms 896 KB Output is correct
43 Correct 35 ms 896 KB Output is correct
44 Correct 31 ms 896 KB Output is correct
45 Correct 31 ms 896 KB Output is correct
46 Correct 23 ms 896 KB Output is correct
47 Correct 11 ms 384 KB Output is correct
48 Correct 26 ms 896 KB Output is correct
49 Correct 13 ms 384 KB Output is correct
50 Correct 23 ms 768 KB Output is correct
51 Correct 19 ms 896 KB Output is correct
52 Correct 10 ms 512 KB Output is correct
53 Correct 16 ms 768 KB Output is correct
54 Correct 87 ms 1016 KB Output is correct
55 Correct 79 ms 896 KB Output is correct
56 Correct 70 ms 896 KB Output is correct
57 Correct 58 ms 1016 KB Output is correct