CP-Algorithms Library

This documentation is automatically generated by competitive-verifier/competitive-verifier

View the Project on GitHub cp-algorithms/cp-algorithms-aux

:heavy_check_mark: Power Projection of Set Power Series (verify/math/subset_power_projection.test.cpp)

Depends on

Code

// @brief Power Projection of Set Power Series
#define PROBLEM "https://judge.yosupo.jp/problem/power_projection_of_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() {
    uint32_t n, M;
    cin >> n >> M;
    size_t N = 1 << n;
    cp_algo::big_vector<base> g(N);
    for(auto &it: g) {cin >> it;}
    cp_algo::big_vector<base> w(N);
    for(auto &it: w) {cin >> it;}
    cp_algo::checkpoint("read");
    auto c = cp_algo::math::subset_power_projection<base>(g, w, M);
    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

Test cases

Env Name Status Elapsed Memory
g++ example_00 :heavy_check_mark: AC 5 ms 6 MB
g++ first_zero_00 :heavy_check_mark: AC 224 ms 50 MB
g++ first_zero_01 :heavy_check_mark: AC 7 ms 6 MB
g++ first_zero_02 :heavy_check_mark: AC 11 ms 6 MB
g++ issue1147_00 :heavy_check_mark: AC 6 ms 6 MB
g++ max_random_00 :heavy_check_mark: AC 233 ms 50 MB
g++ max_random_01 :heavy_check_mark: AC 233 ms 50 MB
g++ max_random_02 :heavy_check_mark: AC 233 ms 50 MB
g++ random_00 :heavy_check_mark: AC 223 ms 50 MB
g++ random_01 :heavy_check_mark: AC 6 ms 6 MB
g++ random_02 :heavy_check_mark: AC 10 ms 6 MB
g++ random_03 :heavy_check_mark: AC 6 ms 6 MB
g++ random_04 :heavy_check_mark: AC 123 ms 27 MB
g++ random_05 :heavy_check_mark: AC 7 ms 6 MB
g++ random_06 :heavy_check_mark: AC 8 ms 6 MB
g++ random_07 :heavy_check_mark: AC 64 ms 15 MB
g++ random_08 :heavy_check_mark: AC 15 ms 7 MB
g++ random_09 :heavy_check_mark: AC 7 ms 6 MB
g++ small_00 :heavy_check_mark: AC 5 ms 4 MB
g++ small_01 :heavy_check_mark: AC 5 ms 6 MB
g++ small_02 :heavy_check_mark: AC 5 ms 6 MB
g++ small_03 :heavy_check_mark: AC 5 ms 4 MB
g++ small_04 :heavy_check_mark: AC 5 ms 6 MB
g++ small_05 :heavy_check_mark: AC 5 ms 6 MB
g++ small_06 :heavy_check_mark: AC 5 ms 6 MB
g++ small_07 :heavy_check_mark: AC 5 ms 4 MB
g++ small_08 :heavy_check_mark: AC 5 ms 6 MB
g++ small_09 :heavy_check_mark: AC 5 ms 6 MB
g++ small_10 :heavy_check_mark: AC 5 ms 6 MB
g++ small_11 :heavy_check_mark: AC 5 ms 6 MB
Back to top page