oj.uz

Submission #480098

# Submission time Handle Problem Language Result Execution time Memory
480098 2021-10-14T15:03:26 Z couplefire Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 59 ms 844 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long

const int K = 60;

map<ll, ll> d[K]; ll b[K];

ll dfs(int pos, ll bd){
    bd = min(bd, b[pos]);
    if(bd<0) return 0; if(pos<0) return 1;
    if(d[pos].count(bd)) return d[pos][bd];
    return d[pos][bd] = dfs(pos-1, bd)+dfs(pos-1, bd-(1ll<<pos));
}

ll count_tastiness(ll x, vector<ll> c){
    c.resize(K); ll cur = 0;
    for(int i = 0; i<K; ++i)
        cur += c[i]*(1ll<<i), b[i] = min(cur/x, 1ll<<i+1), d[i].clear();
    return dfs(K-1, 1e18);
}

Compilation message

biscuits.cpp: In function 'long long int dfs(int, long long int)':
biscuits.cpp:11:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   11 |     if(bd<0) return 0; if(pos<0) return 1;
      |     ^~
biscuits.cpp:11:24: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   11 |     if(bd<0) return 0; if(pos<0) return 1;
      |                        ^~
biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:19:55: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   19 |         cur += c[i]*(1ll<<i), b[i] = min(cur/x, 1ll<<i+1), d[i].clear();
      |                                                      ~^~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 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 0 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 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 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 280 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 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 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 2 ms 340 KB Output is correct
12 Correct 2 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 8 ms 332 KB Output is correct
2 Correct 25 ms 840 KB Output is correct
3 Correct 23 ms 840 KB Output is correct
4 Correct 22 ms 844 KB Output is correct
5 Correct 21 ms 844 KB Output is correct
6 Correct 31 ms 844 KB Output is correct
7 Correct 26 ms 784 KB Output is correct
8 Correct 25 ms 716 KB Output is correct
9 Correct 26 ms 720 KB Output is correct
10 Correct 16 ms 828 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 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 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 0 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 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 0 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 280 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 0 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 2 ms 340 KB Output is correct
35 Correct 2 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 8 ms 332 KB Output is correct
38 Correct 25 ms 840 KB Output is correct
39 Correct 23 ms 840 KB Output is correct
40 Correct 22 ms 844 KB Output is correct
41 Correct 21 ms 844 KB Output is correct
42 Correct 31 ms 844 KB Output is correct
43 Correct 26 ms 784 KB Output is correct
44 Correct 25 ms 716 KB Output is correct
45 Correct 26 ms 720 KB Output is correct
46 Correct 16 ms 828 KB Output is correct
47 Correct 7 ms 332 KB Output is correct
48 Correct 16 ms 844 KB Output is correct
49 Correct 7 ms 332 KB Output is correct
50 Correct 14 ms 732 KB Output is correct
51 Correct 12 ms 716 KB Output is correct
52 Correct 6 ms 332 KB Output is correct
53 Correct 10 ms 684 KB Output is correct
54 Correct 59 ms 844 KB Output is correct
55 Correct 58 ms 844 KB Output is correct
56 Correct 56 ms 820 KB Output is correct
57 Correct 51 ms 728 KB Output is correct