oj.uz

Submission #468345

# Submission time Handle Problem Language Result Execution time Memory
468345 2021-08-27T18:43:01 Z kessido Packing Biscuits (IOI20_biscuits) C++17
42 / 100
 1000 ms 43480 KB 
#include <bits/stdc++.h>
using namespace std;

#define pi pair<int, int>
#define ll long long int
#define vll vector<ll>
#define all(x) (x).begin(), (x).end()
#define fori(i,n) for(int i = 0; i < int(n); i++)

void simplify(ll x, vll& a) {
    while(a.size() < 61) a.push_back(0);
    ll extra = 0;
    for(ll &i : a) {
        extra += i;
        i = min(x, extra);
        extra -= i;
        if(extra&1) i++;
        extra /= 2;
    }
}

unordered_map<ll, ll> dp[60];
ll recurse(const int index,const ll x, vll& a) {
    if(index >= 60) return 1;
    if(dp[index].count(a[index])) return dp[index][a[index]];

    ll ans = 0;

    ll extra = a[index] / 2;
    a[index+1] += extra;
    ans += recurse(index+1, x, a);
    a[index+1] -= extra;

    if(a[index] >= x) {
        extra = (a[index] - x) / 2;
        a[index+1] += extra;
        ans += recurse(index+1, x, a);
        a[index+1] -= extra;
    }

    return dp[index][a[index]] = ans;
}

ll count_tastiness(ll x, vll a) {
    simplify(x, a);
    fori(i,60) dp[i].clear();
    return recurse(0, x, a);
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 292 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 0 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 296 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 204 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 75 ms 13952 KB Output is correct
2 Correct 126 ms 7492 KB Output is correct
3 Correct 243 ms 11988 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 632 ms 14356 KB Output is correct
9 Correct 374 ms 10464 KB Output is correct
10 Correct 1 ms 292 KB Output is correct
11 Correct 7 ms 588 KB Output is correct
12 Correct 69 ms 2828 KB Output is correct
13 Correct 705 ms 14396 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1097 ms 43480 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 292 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 0 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 296 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 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 75 ms 13952 KB Output is correct
25 Correct 126 ms 7492 KB Output is correct
26 Correct 243 ms 11988 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 632 ms 14356 KB Output is correct
32 Correct 374 ms 10464 KB Output is correct
33 Correct 1 ms 292 KB Output is correct
34 Correct 7 ms 588 KB Output is correct
35 Correct 69 ms 2828 KB Output is correct
36 Correct 705 ms 14396 KB Output is correct
37 Execution timed out 1097 ms 43480 KB Time limit exceeded
38 Halted 0 ms 0 KB -