oj.uz

Submission #837098

# Submission time Handle Problem Language Result Execution time Memory
837098 2023-08-24T23:19:26 Z azatega Packing Biscuits (IOI20_biscuits) C++14
21 / 100
 1000 ms 63300 KB 
#include <iostream>
#include <map>
#include <vector>

using namespace std;

#define ll long long

map<pair<int, ll>, ll> memo;
vector<ll> a;
int n;
ll x;

ll compute(int k, ll amount){
    if(memo[{k, amount}] > 0)
        return memo[{k, amount}];

    if(k == a.size() - 1){
        // last one
        ll res = 1; // can always be zero
        if(amount >= x) // can be 1
            res++;
        memo[{k, amount}] = res;
        return res;
    }

    ll res = 0;
    if(amount >= x)
        res += compute(k+1, a[k+1] + (amount - x)/2); // can be 1
    res += compute(k+1, a[k+1] + amount/2); // can be 0
    memo[{k, amount}] = res;
    // cout << k << " - " << amount << ": " << memo[{k, amount}] << endl;
    return res;
}

long long count_tastiness(long long _x, vector<long long> _a){
    memo.clear();

    a = _a;
    x = _x;
    n = _a.size();

    for(int i = 0; i < 100; i++)
        a.push_back(0);

    return compute(0, a[0]);
}

Compilation message

biscuits.cpp: In function 'long long int compute(int, long long int)':
biscuits.cpp:18:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     if(k == a.size() - 1){
      |        ~~^~~~~~~~~~~~~~~

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 340 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 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 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 3 ms 340 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 1 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 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 21900 KB Output is correct
2 Correct 455 ms 11212 KB Output is correct
3 Correct 778 ms 17884 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Execution timed out 1044 ms 22472 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

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

Subtask #5
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 340 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 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 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 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 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 195 ms 21900 KB Output is correct
25 Correct 455 ms 11212 KB Output is correct
26 Correct 778 ms 17884 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Execution timed out 1044 ms 22472 KB Time limit exceeded
32 Halted 0 ms 0 KB -