# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
430116 | amoo_safar | Packing Biscuits (IOI20_biscuits) | C++17 | 922 ms | 1292 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>
#define F first
#define S second
#define pb push_back
using namespace std;
typedef long long ll;
const int N = 63;
ll dp[N];
ll Get(ll idx, ll i){
if(idx == 0)
return i;
assert(i < dp[idx]);
if(i < dp[idx - 1])
return Get(idx - 1, i);
return Get(idx - 1, i - dp[idx - 1]) + (1ll << idx);
}
int k;
ll x;
vector<ll> nw;
bool Valid(ll y){
vector<ll> tmp = nw;
tmp.resize(N, 0);
# | 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... |