이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <iostream>
#include <fstream>
#include <algorithm>
#include <cstring>
#include <climits>
#include <cassert>
#include <tuple>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <string>
using namespace std;
typedef long long LL;
typedef vector<int> Vi;
typedef vector<LL> VL;
typedef vector<bool> Vb;
typedef vector<vector<int>> Vii;
#define MAXP 61
#define forR(i, n) for (int i = 0; i < (n); i++)
VL preSum(MAXP);
LL count(LL x, VL a, int p) {
// [ 0, 2^p ) ++ [ 2^p , 2^(p+1) )
if (p == 0) {
return a[0] >= x ? 2 : 1;
}
LL count_before_p = count(x, a, p - 1);
if (a[p] >= x) {
return 2 * count_before_p;
} else if (p > 0 && a[p] + (preSum[p - 1] >> p) >= x) {
LL rest = (x - a[p]) * (1LL << p);
for (int c = p - 1; c >= 0 && rest > 0; c--) {
LL cnt = min(a[c], rest / (1LL << c));
rest -= cnt * (1LL << c);
a[c] -= cnt;
}
assert(rest == 0);
LL chooseP = 0;
auto preSumBackup = preSum;
{
forR(i, p) {
preSum[i] = i > 0 ? preSum[i - 1] : 0;
preSum[i] += ((LL)1 << i) * a[i];
}
chooseP = count(x, a, p - 1);
}
preSum = preSumBackup;
return count_before_p + chooseP;
} else {
return count_before_p;
}
}
LL count_tastiness(LL x, VL a) {
int k = a.size();
a.resize(MAXP);
forR(i, MAXP) {
preSum[i] = i > 0 ? preSum[i - 1] : 0;
preSum[i] += ((LL)1 << i) * a[i];
}
return count(x, a, MAXP - 1);
}
#ifdef TEST_LOCAL
int main() {
LL res;
res = count_tastiness(3, VL{ 5,2,1 });
res = count_tastiness(2, VL{ 2,1,2 });
return 0;
}
#endif
컴파일 시 표준 에러 (stderr) 메시지
biscuits.cpp: In function 'LL count_tastiness(LL, VL)':
biscuits.cpp:66:6: warning: unused variable 'k' [-Wunused-variable]
66 | int k = a.size();
| ^
# | 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... |