oj.uz

Submission #480097

# Submission time Handle Problem Language Result Execution time Memory
480097 2021-10-14T14:58:53 Z couplefire Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 58 ms 1320 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long

const int K = 60;

map<int, int> dp[K];
int bound[K];

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

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

Compilation message

biscuits.cpp: In function 'long long int dfs(long long 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;
      |                        ^~

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 0 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 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 ms 296 KB Output is correct
6 Correct 1 ms 296 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 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 292 KB Output is correct
8 Correct 1 ms 324 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 5 ms 368 KB Output is correct
2 Correct 33 ms 784 KB Output is correct
3 Correct 22 ms 1100 KB Output is correct
4 Correct 24 ms 1212 KB Output is correct
5 Correct 20 ms 1204 KB Output is correct
6 Correct 29 ms 1100 KB Output is correct
7 Correct 28 ms 1100 KB Output is correct
8 Correct 27 ms 1228 KB Output is correct
9 Correct 27 ms 1100 KB Output is correct
10 Correct 17 ms 1072 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 0 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 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 296 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 2 ms 296 KB Output is correct
20 Correct 1 ms 296 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 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 292 KB Output is correct
31 Correct 1 ms 324 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 5 ms 368 KB Output is correct
38 Correct 33 ms 784 KB Output is correct
39 Correct 22 ms 1100 KB Output is correct
40 Correct 24 ms 1212 KB Output is correct
41 Correct 20 ms 1204 KB Output is correct
42 Correct 29 ms 1100 KB Output is correct
43 Correct 28 ms 1100 KB Output is correct
44 Correct 27 ms 1228 KB Output is correct
45 Correct 27 ms 1100 KB Output is correct
46 Correct 17 ms 1072 KB Output is correct
47 Correct 6 ms 332 KB Output is correct
48 Correct 15 ms 1320 KB Output is correct
49 Correct 7 ms 332 KB Output is correct
50 Correct 16 ms 1100 KB Output is correct
51 Correct 15 ms 1216 KB Output is correct
52 Correct 7 ms 332 KB Output is correct
53 Correct 12 ms 1076 KB Output is correct
54 Correct 58 ms 1184 KB Output is correct
55 Correct 58 ms 1200 KB Output is correct
56 Correct 56 ms 1208 KB Output is correct
57 Correct 43 ms 1224 KB Output is correct