oj.uz

Submission #698972

# Submission time Handle Problem Language Result Execution time Memory
698972 2023-02-15T05:27:49 Z sharaelong Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 129 ms 1324 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const int MAX_N = 60;

ll f[MAX_N];
map<pair<int, ll>, ll> dp;

ll solve(int i, ll j) {
    if (j < 0) return 0;
    if (i == 0) return (j == 0 ? 1 : (f[i] == 0 ? 1 : 2));
    if (dp.find({ i, j }) == dp.end()) dp[{i, j}] = -1;
    ll& ret = dp[{i,j}];
    if (ret != -1) return ret;

    ret = solve(i-1, min({ j, (1ll << i)-1, f[i] }))
        + solve(i-1, min({ j-(1ll << i), (1ll << i)-1, f[i]-(1ll << i) }));
    return ret;
}

ll count_tastiness(ll x, vector<ll> a) {
    for (int i=0; i<MAX_N; ++i) {
        ll sum = 0;
        for (int j=0; j<min(i+1, (int)a.size()); ++j) sum += a[j] * (1ll << j);
        f[i] = sum / x;
    }

    dp.clear();
    ll ret = solve(MAX_N-1, (1ll << MAX_N)-1);
    return ret;
}

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 300 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 0 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
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 300 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 0 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 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 304 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 1 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 240 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
10 Correct 1 ms 212 KB Output is correct
11 Correct 2 ms 296 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 340 KB Output is correct
2 Correct 54 ms 1108 KB Output is correct
3 Correct 55 ms 1212 KB Output is correct
4 Correct 51 ms 1196 KB Output is correct
5 Correct 49 ms 1216 KB Output is correct
6 Correct 52 ms 1108 KB Output is correct
7 Correct 52 ms 1168 KB Output is correct
8 Correct 51 ms 1160 KB Output is correct
9 Correct 51 ms 1108 KB Output is correct
10 Correct 36 ms 1168 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 300 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 0 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
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 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 304 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 296 KB Output is correct
26 Correct 1 ms 300 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 240 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 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 2 ms 296 KB Output is correct
35 Correct 2 ms 340 KB Output is correct
36 Correct 2 ms 340 KB Output is correct
37 Correct 8 ms 340 KB Output is correct
38 Correct 54 ms 1108 KB Output is correct
39 Correct 55 ms 1212 KB Output is correct
40 Correct 51 ms 1196 KB Output is correct
41 Correct 49 ms 1216 KB Output is correct
42 Correct 52 ms 1108 KB Output is correct
43 Correct 52 ms 1168 KB Output is correct
44 Correct 51 ms 1160 KB Output is correct
45 Correct 51 ms 1108 KB Output is correct
46 Correct 36 ms 1168 KB Output is correct
47 Correct 11 ms 408 KB Output is correct
48 Correct 24 ms 1324 KB Output is correct
49 Correct 15 ms 412 KB Output is correct
50 Correct 22 ms 1160 KB Output is correct
51 Correct 15 ms 1236 KB Output is correct
52 Correct 10 ms 340 KB Output is correct
53 Correct 14 ms 1200 KB Output is correct
54 Correct 129 ms 1204 KB Output is correct
55 Correct 125 ms 1212 KB Output is correct
56 Correct 118 ms 1216 KB Output is correct
57 Correct 97 ms 1228 KB Output is correct