이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
// I can do all things through Christ who strengthens me
// Philippians 4:13
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
#define REP(i, j, k) for (int i = j; i < (k); i++)
#define RREP(i, j, k) for (int i = j; i >= (k); i--)
template <class T>
inline bool mnto(T &a, const T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T &a, const T b) {return a < b ? a = b, 1 : 0;}
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define ALL(x) x.begin(), x.end()
#define SZ(x) (int) x.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef tuple<int, int, int> iii;
typedef vector<iii> viii;
#ifndef DEBUG
#define cerr if (0) cerr
#endif
const int INF = 1000000005;
const ll LINF = 1000000000000000005;
const int MAXK = 62;
int k;
ll x;
vll a;
ll dp[MAXK][2];
ll count_tastiness(ll _x, vll _a) {
x = _x; a = _a;
k = SZ(a);
ll sm = 0;
REP (i, 0, k) {
sm += a[i] << i;
}
if (sm == 0) {
return 1;
}
k = 64 - __builtin_clzll(sm);
a.resize(k, 0);
REP (i, 0, k) {
ll ex = (a[i] - 1) / 2;
if (i + 1 == k) {
assert(ex == 0);
break;
}
a[i] -= ex * 2;
a[i + 1] += ex;
}
REP (i, 0, k) {
cerr << i << ": " << a[i] << '\n';
}
dp[0][0] = 1;
REP (i, 1, k + 1) {
REP (j, 0, 2) {
dp[i][j] = 0;
}
REP (j, 0, 2) {
int ta = a[i - 1] + j;
dp[i][ta / 2] += dp[i - 1][j];
if (ta >= 1) {
dp[i][(ta - 1) / 2] += dp[i - 1][j];
}
}
}
return dp[k][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... |