# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
838526 | 2023-08-27T10:30:29 Z | caganyanmaz | Packing Biscuits (IOI20_biscuits) | C++17 | 332 ms | 22688 KB |
#include <bits/stdc++.h> #define pb push_back #define ll long long #define int long long using namespace std; //#define DEBUGGING #ifdef DEBUGGING #include "../debug.h" #else #define debug(x...) void(42) #endif int MXK = 62; ll count_tastiness(ll x, vector<ll> a) { if (x >= 1e5) return 1; if (x > 1e4) MXK = 30; else MXK = 63; while (a.size() < MXK-1) a.pb(0); for (int i = 0; i < MXK-2; i++) { ll change = max<ll>((a[i] - x) / 2, 0); a[i+1] += change; a[i] -= change * 2; } vector<ll> pf(MXK, 0); for (int i = 1; i < MXK; i++) pf[i] = pf[i-1] + (a[i-1] << (i-1)); vector<vector<ll>> dp(MXK, vector<ll>(x+3, 0)); // Last open bit dp[0][0] = 1; for (int i = 1; i < MXK; i++) for (int j = 0; j < i; j++) for (int k = 0; k < x+3; k++) if (((pf[i] - pf[j] + (k<<(j-1)))>>(i-1)) >= x) dp[i][((pf[i]-pf[j]+(k<<(j-1)))>>(i-1))-x] += dp[j][k]; ll res = 0; for (int i = 0; i < MXK; i++) for (int j = 0; j < x + 3; j++) res += dp[i][j]; debug(dp, res); return res; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 2 ms | 340 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 0 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 | 0 ms | 212 KB | Output is correct |
9 | Correct | 1 ms | 212 KB | Output is correct |
10 | Correct | 304 ms | 22688 KB | Output is correct |
11 | Correct | 112 ms | 4784 KB | Output is correct |
12 | Correct | 1 ms | 212 KB | Output is correct |
13 | Correct | 1 ms | 212 KB | Output is correct |
14 | Correct | 3 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 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 | 0 ms | 212 KB | Output is correct |
5 | Correct | 1 ms | 212 KB | Output is correct |
6 | Correct | 0 ms | 212 KB | Output is correct |
7 | Correct | 0 ms | 212 KB | Output is correct |
8 | Correct | 1 ms | 212 KB | Output is correct |
9 | Correct | 1 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 130 ms | 5300 KB | Output is correct |
2 | Correct | 100 ms | 4668 KB | Output is correct |
3 | Correct | 123 ms | 4964 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 | 316 ms | 5428 KB | Output is correct |
9 | Correct | 273 ms | 5300 KB | Output is correct |
10 | Correct | 1 ms | 212 KB | Output is correct |
11 | Correct | 5 ms | 340 KB | Output is correct |
12 | Correct | 45 ms | 984 KB | Output is correct |
13 | Correct | 332 ms | 5348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 155 ms | 15420 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 2 ms | 340 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 0 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 | 0 ms | 212 KB | Output is correct |
9 | Correct | 1 ms | 212 KB | Output is correct |
10 | Correct | 304 ms | 22688 KB | Output is correct |
11 | Correct | 112 ms | 4784 KB | Output is correct |
12 | Correct | 1 ms | 212 KB | Output is correct |
13 | Correct | 1 ms | 212 KB | Output is correct |
14 | Correct | 3 ms | 340 KB | Output is correct |
15 | Correct | 0 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 | 0 ms | 212 KB | Output is correct |
19 | Correct | 1 ms | 212 KB | Output is correct |
20 | Correct | 0 ms | 212 KB | Output is correct |
21 | Correct | 0 ms | 212 KB | Output is correct |
22 | Correct | 1 ms | 212 KB | Output is correct |
23 | Correct | 1 ms | 212 KB | Output is correct |
24 | Correct | 130 ms | 5300 KB | Output is correct |
25 | Correct | 100 ms | 4668 KB | Output is correct |
26 | Correct | 123 ms | 4964 KB | Output is correct |
27 | Correct | 1 ms | 212 KB | Output is correct |
28 | Correct | 1 ms | 212 KB | Output is correct |
29 | Correct | 1 ms | 212 KB | Output is correct |
30 | Correct | 1 ms | 212 KB | Output is correct |
31 | Correct | 316 ms | 5428 KB | Output is correct |
32 | Correct | 273 ms | 5300 KB | Output is correct |
33 | Correct | 1 ms | 212 KB | Output is correct |
34 | Correct | 5 ms | 340 KB | Output is correct |
35 | Correct | 45 ms | 984 KB | Output is correct |
36 | Correct | 332 ms | 5348 KB | Output is correct |
37 | Incorrect | 155 ms | 15420 KB | Output isn't correct |
38 | Halted | 0 ms | 0 KB | - |