oj.uz

Submission #568503

# Submission time Handle Problem Language Result Execution time Memory
568503 2022-05-25T15:31:35 Z 2fat2code Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 42 ms 1308 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
#define fr first
#define sc second
#define all(s) s.begin(), s.end()
#define int long long
using namespace std;

const int nmax = 60;

int k, sum[nmax], total, X;

unordered_map<int, int>prec;

int calculate(int n){
  //  cout << n << '\n';
    if(prec.count(n)){
        return prec[n];
    }
    else if(n < 0LL) return 0LL;
    else{
        int largestbit = 0;
        while((1LL << (largestbit + 1LL)) <= n){
            ++largestbit;
        }
        prec[n] = calculate((1LL << largestbit) - 1LL) + calculate(min(n, sum[largestbit] / X) - (1LL << largestbit));
        return prec[n];
    }
}

int count_tastiness(int x, vector<int> a) {
    total = 0;
    X = x;
    prec.clear();
    k = (int)a.size();
    for(int i=0;i<k;i++) sum[i] = 0;
    for(int i=0;i<k;i++){
        total += (a[i] * (1LL << i));
        sum[i] += (a[i] * (1LL << i));
        if(i) sum[i] += sum[i - 1];
    }
    for(int i=k;i<60;i++) sum[i] = sum[i - 1];
    prec[0] = 1;
    int ans =  calculate(total / x);
    return ans;
}

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 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 300 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 300 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 212 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 304 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 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 300 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 340 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 212 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 3 ms 340 KB Output is correct
2 Correct 16 ms 1204 KB Output is correct
3 Correct 19 ms 1108 KB Output is correct
4 Correct 16 ms 1112 KB Output is correct
5 Correct 15 ms 1108 KB Output is correct
6 Correct 17 ms 1108 KB Output is correct
7 Correct 17 ms 1080 KB Output is correct
8 Correct 18 ms 1108 KB Output is correct
9 Correct 17 ms 1104 KB Output is correct
10 Correct 21 ms 1108 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 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 300 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 300 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 212 KB Output is correct
15 Correct 1 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 304 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 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 300 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 340 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 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 3 ms 340 KB Output is correct
38 Correct 16 ms 1204 KB Output is correct
39 Correct 19 ms 1108 KB Output is correct
40 Correct 16 ms 1112 KB Output is correct
41 Correct 15 ms 1108 KB Output is correct
42 Correct 17 ms 1108 KB Output is correct
43 Correct 17 ms 1080 KB Output is correct
44 Correct 18 ms 1108 KB Output is correct
45 Correct 17 ms 1104 KB Output is correct
46 Correct 21 ms 1108 KB Output is correct
47 Correct 6 ms 388 KB Output is correct
48 Correct 32 ms 1308 KB Output is correct
49 Correct 11 ms 440 KB Output is correct
50 Correct 22 ms 1096 KB Output is correct
51 Correct 8 ms 1252 KB Output is correct
52 Correct 2 ms 340 KB Output is correct
53 Correct 8 ms 1096 KB Output is correct
54 Correct 42 ms 1168 KB Output is correct
55 Correct 33 ms 1108 KB Output is correct
56 Correct 30 ms 1208 KB Output is correct
57 Correct 30 ms 1108 KB Output is correct