# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1082814 | beaconmc | Packing Biscuits (IOI20_biscuits) | C++14 | 1038 ms | 55072 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "biscuits.h"
#include <bits/stdc++.h>
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
using namespace std;
vector<ll> A(200);
ll X;
unordered_map<ll,unordered_map<ll,ll>> dps;
ll cnt = 0;
ll dp(ll pos, ll add){
cnt++;
if (dps[pos].count(add)) return dps[pos][add];
if (pos>200) return 1;
ll temp = 0;
if (add==0){
ll cur = 0;
while (cur <= X && cur <= A[pos]){
temp += dp(pos+1, (A[pos]-cur)/2);
cur += X;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |