Convolution mod $10^9+7$ (verify/poly/convolution107.test.cpp)

• View this file on GitHub
• Last update: 2025-12-12 22:29:00+01:00
• Problem: https://judge.yosupo.jp/problem/convolution_mod_1000000007

Depends on

• cp-algo/math/common.hpp
• cp-algo/math/cvector.hpp
• cp-algo/math/fft.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 Convolution mod $10^9+7$
#define PROBLEM "https://judge.yosupo.jp/problem/convolution_mod_1000000007"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#define CP_ALGO_CHECKPOINT
#include <bits/stdc++.h>
//#include "blazingio/blazingio.min.hpp"
#include "cp-algo/math/fft.hpp"

using namespace std;
using namespace cp_algo::math;

const int mod = 1e9 + 7;
using base = modint<mod>;

void solve() {
    int n, m;
    cin >> n >> m;
    cp_algo::big_vector<base> a(n), b(m);
    for(auto &x: a) {cin >> x;}
    for(auto &x: b) {cin >> x;}
    cp_algo::checkpoint("read");
    fft::mul(a, b);
    for(auto x: a) {cout << x << " ";}
    cp_algo::checkpoint("write");
}

signed main() {
    //freopen("input.txt", "r", stdin);
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    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++	all_same_00	AC	121 ms	45 MB
g++	all_same_01	AC	154 ms	45 MB
g++	all_same_02	AC	147 ms	45 MB
g++	all_same_03	AC	145 ms	45 MB
g++	example_00	AC	6 ms	4 MB
g++	example_01	AC	5 ms	4 MB
g++	fft_killer_00	AC	136 ms	45 MB
g++	fft_killer_01	AC	138 ms	45 MB
g++	fft_killer_02	AC	141 ms	45 MB
g++	fft_killer_03	AC	137 ms	45 MB
g++	fft_killer_04	AC	141 ms	45 MB
g++	fft_killer_05	AC	148 ms	45 MB
g++	fft_killer_06	AC	137 ms	45 MB
g++	fft_killer_07	AC	138 ms	45 MB
g++	fft_killer_08	AC	138 ms	45 MB
g++	fft_killer_09	AC	137 ms	45 MB
g++	max_ans_zero_00	AC	139 ms	45 MB
g++	max_random_00	AC	146 ms	45 MB
g++	max_random_01	AC	140 ms	45 MB
g++	medium_00	AC	7 ms	4 MB
g++	medium_01	AC	6 ms	4 MB
g++	medium_02	AC	6 ms	4 MB
g++	medium_all_zero_00	AC	6 ms	4 MB
g++	random_00	AC	122 ms	43 MB
g++	random_01	AC	122 ms	44 MB
g++	random_02	AC	63 ms	23 MB
g++	signed_overflow_00	AC	6 ms	4 MB
g++	small_00	AC	5 ms	4 MB
g++	small_01	AC	5 ms	4 MB
g++	small_02	AC	5 ms	4 MB
g++	small_03	AC	5 ms	4 MB
g++	small_04	AC	5 ms	4 MB
g++	small_05	AC	5 ms	4 MB
g++	small_06	AC	5 ms	4 MB
g++	small_07	AC	5 ms	4 MB
g++	small_08	AC	5 ms	4 MB
g++	small_09	AC	5 ms	4 MB
g++	small_10	AC	5 ms	4 MB
g++	small_11	AC	5 ms	4 MB
g++	small_12	AC	5 ms	4 MB
g++	small_13	AC	5 ms	4 MB
g++	small_14	AC	5 ms	4 MB
g++	small_15	AC	5 ms	4 MB
g++	small_and_large_00	AC	83 ms	41 MB
g++	small_and_large_01	AC	86 ms	41 MB
g++	small_and_large_02	AC	89 ms	43 MB
g++	small_and_large_03	AC	83 ms	43 MB
g++	unsigned_overflow_00	AC	5 ms	4 MB

Back to top page