oj.uz

Submission #622493

# Submission time Handle Problem Language Result Execution time Memory
622493 2022-08-04T10:29:46 Z wiwiho Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 17 ms 1336 KB 
#include "biscuits.h"

#include <bits/stdc++.h>

#define iter(a) a.begin(), a.end()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(iter(a), greater<>())
#define eb emplace_back
#define ef emplace_front
#define pob pop_back()
#define pof pop_front()
#define mp make_pair
#define F first
#define S second
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) { \
    for(auto pv : a) b << pv << " "; \
    b << "\n"; \
}

using namespace std;

typedef long long ll;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

const int K = 61;
long long count_tastiness(ll x, vector<ll> a){
    
    a.resize(K);
    vector<ll> s(K);
    for(int i = 0; i < K; i++){
        s[i] = a[i] * (1LL << i);
        if(i) s[i] += s[i - 1];
    }

    vector<ll> dp(K); // g(2^i) = dp[i];
    dp[0] = 1;

    function<ll(ll)> g = [&](ll n) -> ll{
        if(n <= 0) return 0;
        if((1LL << __lg(n)) == n) return dp[__lg(n)];
        int i = __lg(n);
        return g(1LL << i) + g(min(n, s[i] / x + 1) - (1LL << i));
    };

    for(int i = 1; i < K; i++){
        ll n = 1LL << i;
        dp[i] = dp[i - 1] + g(min(n, s[i - 1] / x + 1) - (1LL << (i - 1)));
    }

    return dp[K - 1];
}

Subtask #1
9.0 / 9.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 10 ms 1104 KB Output is correct
3 Correct 10 ms 1176 KB Output is correct
4 Correct 10 ms 1072 KB Output is correct
5 Correct 10 ms 1200 KB Output is correct
6 Correct 10 ms 1108 KB Output is correct
7 Correct 9 ms 1148 KB Output is correct
8 Correct 11 ms 1084 KB Output is correct
9 Correct 9 ms 1108 KB Output is correct
10 Correct 10 ms 1108 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 0 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 0 ms 300 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 296 KB Output is correct
12 Correct 1 ms 300 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 296 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 296 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 300 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 212 KB Output is correct
36 Correct 1 ms 300 KB Output is correct
37 Correct 2 ms 340 KB Output is correct
38 Correct 10 ms 1104 KB Output is correct
39 Correct 10 ms 1176 KB Output is correct
40 Correct 10 ms 1072 KB Output is correct
41 Correct 10 ms 1200 KB Output is correct
42 Correct 10 ms 1108 KB Output is correct
43 Correct 9 ms 1148 KB Output is correct
44 Correct 11 ms 1084 KB Output is correct
45 Correct 9 ms 1108 KB Output is correct
46 Correct 10 ms 1108 KB Output is correct
47 Correct 2 ms 380 KB Output is correct
48 Correct 10 ms 1328 KB Output is correct
49 Correct 3 ms 340 KB Output is correct
50 Correct 9 ms 1108 KB Output is correct
51 Correct 9 ms 1336 KB Output is correct
52 Correct 2 ms 340 KB Output is correct
53 Correct 10 ms 1108 KB Output is correct
54 Correct 17 ms 1236 KB Output is correct
55 Correct 15 ms 1108 KB Output is correct
56 Correct 13 ms 1200 KB Output is correct
57 Correct 14 ms 1272 KB Output is correct