# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
838499 | 2023-08-27T09:47:48 Z | caganyanmaz | Packing Biscuits (IOI20_biscuits) | C++17 | 1 ms | 596 KB |
#include <bits/stdc++.h> #define pb push_back #define ll long long using namespace std; //#define DEBUGGING #ifdef DEBUGGING #include "../debug.h" #else #define debug(x...) void(42) #endif constexpr static int MXK = 62; ll count_tastiness(ll x, vector<ll> a) { assert(x == 1); int k = a.size(); while (a.size() < MXK-1) a.pb(0); for (int i = 0; i < MXK; i++) { ll change = max<ll>((a[i] - x) / 2, 0); a[i+1] += change; a[i] -= change * 2; } vector<ll> pf(MXK, 0); pf[0] = 0; for (int i = 1; i < MXK; i++) pf[i] = pf[i-1] + (a[i-1] << (i-1)); vector<ll> dp(MXK, 0); // Last open bit dp[0] = 1; for (int i = 1; i < MXK; i++) for (int j = 0; j < i; j++) if ((pf[i] - pf[j]) >= (x<<(i-1))) dp[i] += dp[j]; ll res = 0; for (int i = 0; i < MXK; i++) res += dp[i]; debug(dp, res); return res; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 592 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 596 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |