QOJ.ac
QOJ
The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#617867 | #8834. Formal Fring | UP!! (Jungeng Lin, Nengxiang Xiao) | RE | 0ms | 0kb | C++17 | 2.2kb | 2024-10-06 17:27:13 | 2024-10-06 17:27:16 |
Judging History
answer
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#define ll long long
#define all(v) v.begin(),v.end()
#define sz(v) ((ll)v.size())
#define V vector
#define vi V<int>
#define vll V<ll>
#define eb emplace_back
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
#define A array
#define pb push_back
#define mset multiset
#define gpumap __gnu_pbds::gp_hash_table
#define ccumap __gnu_pbds::cc_hash_table
#define ui unsigned int
#define ull unsigned ll
#define i128 __int128
#define cerr if (test) cerr
#define freopen if (test) freopen
#define whtest if (test)
using namespace std;
const int test = 1;
namespace jhsy {
constexpr int P = 998244353;
const int N = 1e6,LG = __lg(N);
A<A<ll,N+1>,LG+1> f,g;
void init(const int n = N,const int lg = LG) {
f[0].fill(1);
for (int j = 1; j <= lg; j++) {
for (int i = 0; i <= n; i++) {
f[j][i] = f[j-1][i];
}
const int x = 1<<j;
for (int i = x; i <= n; i++) {
f[j][i] = (f[j][i]+f[j][i-x])%P;
}
}
for (int i = 0; i <= LG; i++) {
g[i][0] = g[i][1] = 1;
}
auto solve = [&](int n) {
const int k = __lg(n);
const int a = 1<<(k - 1),b = n - a,d = (1 << k) - 1,c = n - d;
if (max(a,c) > min(b,d)) {
for (int i = 0; i <= lg; i++) {
g[i][n] = f[i][n];
}
}
else if (a > c) {
for (int i = k; i <= lg; i++) {
g[i][n] = f[lg][n - (1 << k)];
}
}
else {
for (int i = k; i <= lg; i++) {
g[i][n] = f[k][n - (1 << k)];
}
for (int i = k - 1; i >= 0 && (d + 1) - (1 << i) < c; i--) {
for (int j = i; j <= lg; j++) {
g[j][n] = (g[j][n]+ f[j-i][(1<<(k - i)) - 1] * g[i][n - (1 << k)]) % P;
}
}
}
};
for (int i = 2; i <= n; i++) {
solve(i);
}
}
void main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cout << g[LG][i] << " \n"[i == n];
}
}
}
int main() {
freopen("test.in","r",stdin);
freopen("test.out","w",stdout);
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
jhsy::init();
int T = 1;
// cin >> T;
while (T--) {
jhsy::main();
}
return 0;
}
详细
Test #1:
score: 0
Dangerous Syscalls
input:
10