This documentation is automatically generated by competitive-verifier/competitive-verifier
// @brief Polynomial Composite Set Power Series
#define PROBLEM "https://judge.yosupo.jp/problem/polynomial_composite_set_power_series"
#pragma GCC optimize("O3,unroll-loops")
#include <bits/allocator.h>
#pragma GCC target("avx2")
#include <iostream>
#include "blazingio/blazingio.min.hpp"
#define CP_ALGO_CHECKPOINT
#include "cp-algo/number_theory/modint.hpp"
#include "cp-algo/math/subset_convolution.hpp"
#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
using base = cp_algo::math::modint<mod>;
void solve() {
size_t M, n;
cin >> M >> n;
size_t N = 1 << n;
cp_algo::big_vector<base> f(M);
for(auto &it: f) {cin >> it;}
cp_algo::big_vector<base> a(N);
for(auto &it: a) {cin >> it;}
cp_algo::checkpoint("read");
auto c = cp_algo::math::subset_compose<base>(f, a);
for(auto &it: c) {cout << it << ' ';}
cp_algo::checkpoint("write");
cp_algo::checkpoint<1>();
}
signed main() {
//freopen("input.txt", "r", stdin);
ios::sync_with_stdio(0);
cin.tie(0);
int t;
t = 1;// cin >> t;
while(t--) {
solve();
}
}
Traceback (most recent call last):
File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj_resolve/resolver.py", line 181, in resolve
bundled_code = language.bundle(path, basedir=basedir)
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus.py", line 252, in bundle
bundler.update(path)
File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 327, in update
assert len(lines) == len(uncommented_lines)
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
AssertionError
| Env | Name | Status | Elapsed | Memory |
|---|---|---|---|---|
| g++ | example_00 |
|
5 ms | 6 MB |
| g++ | max_random_00 |
|
241 ms | 35 MB |
| g++ | max_random_01 |
|
241 ms | 35 MB |
| g++ | max_random_02 |
|
238 ms | 35 MB |
| g++ | nm_01_00 |
|
4 ms | 6 MB |
| g++ | nm_01_01 |
|
4 ms | 6 MB |
| g++ | nm_01_02 |
|
6 ms | 7 MB |
| g++ | nm_01_03 |
|
4 ms | 6 MB |
| g++ | nm_01_04 |
|
4 ms | 6 MB |
| g++ | nm_01_05 |
|
27 ms | 9 MB |
| g++ | nm_01_06 |
|
5 ms | 7 MB |
| g++ | nm_01_07 |
|
6 ms | 7 MB |
| g++ | random_00 |
|
231 ms | 34 MB |
| g++ | random_01 |
|
56 ms | 13 MB |
| g++ | random_02 |
|
5 ms | 7 MB |
| g++ | small_random_00 |
|
4 ms | 6 MB |
| g++ | small_random_01 |
|
5 ms | 6 MB |
| g++ | small_random_02 |
|
4 ms | 6 MB |