이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define rmin(r, x) r = min(r, x)
#define rmax(r, x) r = max(r, x)
#define ends ' '
#define endl '\n'
#define fastio ios_base::sync_with_stdio(0), cin.tie(0)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int maxk = 65;
const int maxa = 2e5 + 10;
bool p;
ll r[maxk], c[maxk];
ll get_r(ll T) {
if(!T) return 1;
if(T == 1) return r[0] + p;
int i = 63 - __builtin_clzll(T);
return (c[i - 1]) + get_r(T - (1LL << i));
}
long long count_tastiness(long long x, vector<ll> s) {
int k = s.size();
s.resize(maxk);
for(int i = 1; i <= 60; ++i) s[i] = s[i - 1] + (1LL << i) * s[i];
p = (s[0] >= x);
r[0] = p - 1;
c[0] = p + 1;
// cout << 0 << ends << r[0] << ends << c[0] << ends << (s[0] / x - 1) << endl;
for(int i = 1; i <= 60; ++i) {
ll T = s[i] / x - (1LL << i);
if(T < 0) {
r[i] = -1;
}
else {
if((1LL << i) - 1 <= T) r[i] = c[i - 1] - 1;
else r[i] = get_r(T) - 1;
}
c[i] = c[i - 1] + r[i] + 1;
// cout << i << ends << r[i] << ends << c[i] << ends << T << endl;
}
return c[60];
}
컴파일 시 표준 에러 (stderr) 메시지
biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:30:6: warning: unused variable 'k' [-Wunused-variable]
30 | int k = s.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... |