oj.uz

Submission #434662

# Submission time Handle Problem Language Result Execution time Memory
434662 2021-06-21T14:08:07 Z 79brue Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 57 ms 1324 KB 
#include <bits/stdc++.h>
#include "biscuits.h"

using namespace std;

typedef long long ll;

ll arr[105];
ll val[105];
ll p2[105];
ll k;
unordered_map<ll, ll> DP[102];

ll solve(int x, ll y){
    if(x==0) return y+1;
    if(DP[x][y]) return DP[x][y];
    ll ret = 0;
    ret += solve(x-1, min({val[x-1], y, p2[x]-1}));
    if(y >= p2[x]) ret += solve(x-1, min({val[x-1], y-p2[x], p2[x]-1}));
    return DP[x][y] = ret;
}

ll count_tastiness(ll _x, vector<ll> a) {
    k = _x;
    a.resize(60);
    for(int i=0; i<60; i++){
        arr[i] = a[i];
        DP[i].clear();
        p2[i] = 1LL<<i;
    }

    for(int i=0; i<60; i++){
        val[i] = 0;
        for(int j=0; j<=i; j++){
            val[i] += arr[j] << j;
        }
        val[i] /= k;
    }

    return solve(59, val[59]);
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 204 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 376 KB Output is correct
2 Correct 34 ms 1164 KB Output is correct
3 Correct 26 ms 1100 KB Output is correct
4 Correct 26 ms 1200 KB Output is correct
5 Correct 25 ms 1220 KB Output is correct
6 Correct 30 ms 1132 KB Output is correct
7 Correct 34 ms 1100 KB Output is correct
8 Correct 27 ms 1100 KB Output is correct
9 Correct 27 ms 1100 KB Output is correct
10 Correct 21 ms 1160 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 304 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 10 ms 376 KB Output is correct
38 Correct 34 ms 1164 KB Output is correct
39 Correct 26 ms 1100 KB Output is correct
40 Correct 26 ms 1200 KB Output is correct
41 Correct 25 ms 1220 KB Output is correct
42 Correct 30 ms 1132 KB Output is correct
43 Correct 34 ms 1100 KB Output is correct
44 Correct 27 ms 1100 KB Output is correct
45 Correct 27 ms 1100 KB Output is correct
46 Correct 21 ms 1160 KB Output is correct
47 Correct 11 ms 332 KB Output is correct
48 Correct 24 ms 1324 KB Output is correct
49 Correct 15 ms 412 KB Output is correct
50 Correct 21 ms 1180 KB Output is correct
51 Correct 16 ms 1300 KB Output is correct
52 Correct 7 ms 332 KB Output is correct
53 Correct 14 ms 1200 KB Output is correct
54 Correct 57 ms 1180 KB Output is correct
55 Correct 55 ms 1196 KB Output is correct
56 Correct 49 ms 1204 KB Output is correct
57 Correct 43 ms 1216 KB Output is correct