Lazy FPS: Product with a Known Polynomial (verify/fps/mul.test.cpp)

• View this file on GitHub
• Last update: 2026-09-10 02:45:56+02:00
• Problem: https://judge.yosupo.jp/problem/convolution_mod

Depends on

• cp-algo/math/combinatorics.hpp
• cp-algo/math/common.hpp
• cp-algo/math/cvector.hpp
• cp-algo/math/dft.hpp
• cp-algo/math/fft.hpp
• cp-algo/math/fps.hpp
• cp-algo/math/poly/base.hpp
• cp-algo/number_theory/modint.hpp
• cp-algo/random/rng.hpp
• cp-algo/util/big_alloc.hpp
• cp-algo/util/checkpoint.hpp
• cp-algo/util/complex.hpp
• cp-algo/util/simd.hpp

Code

// @brief Lazy FPS: Product with a Known Polynomial
#define PROBLEM "https://judge.yosupo.jp/problem/convolution_mod"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include "blazingio/blazingio.min.hpp"
#include "cp-algo/math/fps.hpp"
using namespace cp_algo::math;
using base = modint<998244353>;
using polyn = poly_t<base>;
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int n, m;
    std::cin >> n >> m;
    polyn::Vector a(n), b(m);
    for(auto &x: a) {std::cin >> x;}
    for(auto &x: b) {std::cin >> x;}
    fps<base> stream([b = std::move(b)](size_t i, auto const&) {
        return i < b.size() ? b[i] : base(0);
    });
    (polyn(std::move(a)) * stream).prefix(n + m - 1).print(n + m - 1);
}

Traceback (most recent call last):
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/resolver.py", line 290, in resolve
    bundled_code = language.bundle(path, basedir=basedir)
                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/languages/cplusplus.py", line 243, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/languages/cplusplus_bundle.py", line 322, in update
    assert len(lines) == len(uncommented_lines)
           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
AssertionError

Test cases

Env	Name	Status	Elapsed	Memory
g++	all_same_00	AC	354 ms	71 MB
g++	all_same_01	AC	376 ms	79 MB
g++	all_same_02	AC	363 ms	79 MB
g++	all_same_03	AC	364 ms	79 MB
g++	example_00	AC	3 ms	6 MB
g++	example_01	AC	2 ms	6 MB
g++	fft_killer_00	AC	368 ms	79 MB
g++	fft_killer_01	AC	365 ms	79 MB
g++	fft_killer_02	AC	364 ms	79 MB
g++	fft_killer_03	AC	363 ms	79 MB
g++	fft_killer_04	AC	367 ms	79 MB
g++	fft_killer_05	AC	368 ms	79 MB
g++	fft_killer_06	AC	366 ms	79 MB
g++	fft_killer_07	AC	367 ms	79 MB
g++	fft_killer_08	AC	364 ms	79 MB
g++	fft_killer_09	AC	368 ms	79 MB
g++	max_ans_zero_00	AC	361 ms	79 MB
g++	max_random_00	AC	366 ms	79 MB
g++	max_random_01	AC	367 ms	79 MB
g++	medium_00	AC	5 ms	6 MB
g++	medium_01	AC	4 ms	6 MB
g++	medium_02	AC	5 ms	6 MB
g++	medium_all_zero_00	AC	3 ms	6 MB
g++	medium_pre_suf_zero_00	AC	3 ms	6 MB
g++	medium_pre_suf_zero_01	AC	3 ms	6 MB
g++	medium_pre_suf_zero_02	AC	2 ms	6 MB
g++	medium_pre_suf_zero_03	AC	2 ms	6 MB
g++	medium_pre_suf_zero_04	AC	3 ms	6 MB
g++	random_00	AC	298 ms	76 MB
g++	random_01	AC	316 ms	77 MB
g++	random_02	AC	134 ms	33 MB
g++	signed_overflow_00	AC	3 ms	6 MB
g++	small_00	AC	2 ms	6 MB
g++	small_01	AC	2 ms	6 MB
g++	small_02	AC	2 ms	6 MB
g++	small_03	AC	2 ms	6 MB
g++	small_04	AC	2 ms	6 MB
g++	small_05	AC	2 ms	6 MB
g++	small_06	AC	2 ms	6 MB
g++	small_07	AC	2 ms	6 MB
g++	small_08	AC	2 ms	6 MB
g++	small_09	AC	2 ms	6 MB
g++	small_10	AC	2 ms	6 MB
g++	small_11	AC	2 ms	6 MB
g++	small_12	AC	2 ms	6 MB
g++	small_13	AC	2 ms	6 MB
g++	small_14	AC	2 ms	6 MB
g++	small_15	AC	2 ms	6 MB
g++	small_and_large_00	AC	91 ms	35 MB
g++	small_and_large_01	AC	109 ms	35 MB
g++	small_and_large_02	AC	205 ms	72 MB
g++	small_and_large_03	AC	203 ms	72 MB
g++	unsigned_overflow_00	AC	2 ms	6 MB

Back to top page