oj.uz

Submission #333321

# Submission time Handle Problem Language Result Execution time Memory
333321 2020-12-05T13:14:14 Z nickmet2004 Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 93 ms 1004 KB 
#include<bits/stdc++.h>
#include "biscuits.h"
#define ll long long
using namespace std;
ll Xk;
ll dp[61] , Pr[61];
ll Q(ll w){
    if(w < 0ll)return 0ll;
    if(!w) return 1ll;
    int j;
    for(j = 60; ~j; --j) if((1ll << j) <= w)break;
    return dp[j] + Q(min(w , Pr[j] / Xk) - (1ll << j));
}
ll count_tastiness(ll X , vector<ll> a){
    int n = a.size(); Xk = X;
    a.resize(60);
    for(int i = 0; i < 60; ++i){
        Pr[i] = (1ll << i) * a[i];
        if(i)Pr[i] += Pr[i - 1];
    }
    //for(int i= 0; i < n; ++i)cout << Pr[i] <<  " "; cout << endl;
    dp[0] = 1ll;
    /// 2^k___2^(k+1) - 1
    /// dp[k + 1] = dp[k] + a;
    for(int k = 1; k < 61; ++k) dp[k] = Q((1ll << k) - 1ll);
    return dp[60];
}
/*
int main (){
    cout << count_tastiness(3 , {5 , 2 , 1});
}
*/

Compilation message

biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:15:9: warning: unused variable 'n' [-Wunused-variable]
   15 |     int n = a.size(); Xk = X;
      |         ^

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 256 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 0 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 256 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 376 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 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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 364 KB Output is correct
2 Correct 17 ms 876 KB Output is correct
3 Correct 18 ms 876 KB Output is correct
4 Correct 18 ms 876 KB Output is correct
5 Correct 17 ms 896 KB Output is correct
6 Correct 16 ms 876 KB Output is correct
7 Correct 23 ms 876 KB Output is correct
8 Correct 16 ms 876 KB Output is correct
9 Correct 16 ms 876 KB Output is correct
10 Correct 18 ms 876 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 256 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 0 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 256 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 376 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 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 10 ms 364 KB Output is correct
38 Correct 17 ms 876 KB Output is correct
39 Correct 18 ms 876 KB Output is correct
40 Correct 18 ms 876 KB Output is correct
41 Correct 17 ms 896 KB Output is correct
42 Correct 16 ms 876 KB Output is correct
43 Correct 23 ms 876 KB Output is correct
44 Correct 16 ms 876 KB Output is correct
45 Correct 16 ms 876 KB Output is correct
46 Correct 18 ms 876 KB Output is correct
47 Correct 23 ms 364 KB Output is correct
48 Correct 93 ms 900 KB Output is correct
49 Correct 55 ms 364 KB Output is correct
50 Correct 87 ms 876 KB Output is correct
51 Correct 12 ms 876 KB Output is correct
52 Correct 3 ms 364 KB Output is correct
53 Correct 10 ms 748 KB Output is correct
54 Correct 35 ms 1004 KB Output is correct
55 Correct 30 ms 876 KB Output is correct
56 Correct 27 ms 1004 KB Output is correct
57 Correct 23 ms 876 KB Output is correct