oj.uz

Submission #303458

# Submission time Handle Problem Language Result Execution time Memory
303458 2020-09-20T10:25:54 Z dacin21 Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 123 ms 1016 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

ll solve_2(ll x, vector<ll> a){
    const int k = 61;
    a.resize(61, 0);
    for(int i=0; i+1<k; ++i){
        const ll m = max<ll>(0, (a[i]-x)/2);
        a[i+1] += m;
        a[i] -= 2*m;
    }
    for(auto &e:a){
        assert(0 <= e && e <= x+1);
    }
    // top: dp[needed] -> cnt
    // time: min(x, 2^n-i)
    vector<map<ll, ll> > dp(k+1);
    dp[k][0] = 1;
    int max_s = 0;
    for(int i=k; i>0; --i){
        dp[i].erase(dp[i].upper_bound(x), dp[i].end());
        max_s = max<int>(max_s, dp[i].size());
        for(auto &e:dp[i]){
            const ll f = 2*e.first - a[i-1];
            // no carry
            dp[i-1][max<ll>(0, f)] += e.second;
            // one carry
            dp[i-1][max<ll>(0, f+x)] += e.second;
        }
        //debug << named(dp[i-1]) << "\n";
    }
    //debug << named(max_s) << "\n";
    return dp.front()[0];
}
long long count_tastiness(long long x, std::vector<long long> a) {
	return solve_2(x, a);
}

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 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 256 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 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 384 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 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 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 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 384 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 2 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 20 ms 444 KB Output is correct
2 Correct 71 ms 896 KB Output is correct
3 Correct 81 ms 896 KB Output is correct
4 Correct 67 ms 908 KB Output is correct
5 Correct 65 ms 1016 KB Output is correct
6 Correct 90 ms 896 KB Output is correct
7 Correct 86 ms 896 KB Output is correct
8 Correct 84 ms 916 KB Output is correct
9 Correct 81 ms 896 KB Output is correct
10 Correct 61 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 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 256 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 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 384 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 384 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 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 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 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 1 ms 384 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 2 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 20 ms 444 KB Output is correct
38 Correct 71 ms 896 KB Output is correct
39 Correct 81 ms 896 KB Output is correct
40 Correct 67 ms 908 KB Output is correct
41 Correct 65 ms 1016 KB Output is correct
42 Correct 90 ms 896 KB Output is correct
43 Correct 86 ms 896 KB Output is correct
44 Correct 84 ms 916 KB Output is correct
45 Correct 81 ms 896 KB Output is correct
46 Correct 61 ms 896 KB Output is correct
47 Correct 18 ms 384 KB Output is correct
48 Correct 27 ms 896 KB Output is correct
49 Correct 17 ms 416 KB Output is correct
50 Correct 25 ms 768 KB Output is correct
51 Correct 32 ms 896 KB Output is correct
52 Correct 21 ms 504 KB Output is correct
53 Correct 32 ms 896 KB Output is correct
54 Correct 105 ms 896 KB Output is correct
55 Correct 123 ms 896 KB Output is correct
56 Correct 109 ms 896 KB Output is correct
57 Correct 101 ms 932 KB Output is correct