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: Polynomial Interpolation (Geometric Sequence) (verify/poly/inter_geo.test.cpp)

Depends on

Code

// @brief Polynomial Interpolation (Geometric Sequence)
#define PROBLEM "https://judge.yosupo.jp/problem/polynomial_interpolation_on_geometric_sequence"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include "cp-algo/math/poly.hpp"
#include <bits/stdc++.h>

using namespace std;
using namespace cp_algo::math;

const int mod = 998244353;
using base = modint<mod>;
using polyn = poly_t<base>;

void solve() {
    int n, a, r;
    cin >> n >> a >> r;
    polyn::Vector y(n);
    copy_n(istream_iterator<base>(cin), n, begin(y));
    polyn(y).chirpz_inverse(r, n).mulx(base(a).inv()).print(n);
}

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++ example_00 :heavy_check_mark: AC 6 ms 4 MB
g++ example_01 :heavy_check_mark: AC 6 ms 4 MB
g++ max_random_00 :heavy_check_mark: AC 253 ms 74 MB
g++ max_random_01 :heavy_check_mark: AC 248 ms 74 MB
g++ max_random_02 :heavy_check_mark: AC 251 ms 74 MB
g++ nar_0_00 :heavy_check_mark: AC 6 ms 4 MB
g++ nar_0_01 :heavy_check_mark: AC 5 ms 4 MB
g++ nar_0_02 :heavy_check_mark: AC 5 ms 4 MB
g++ nar_0_03 :heavy_check_mark: AC 5 ms 4 MB
g++ nar_0_04 :heavy_check_mark: AC 5 ms 4 MB
g++ nar_0_05 :heavy_check_mark: AC 5 ms 4 MB
g++ nar_0_06 :heavy_check_mark: AC 5 ms 4 MB
g++ nar_0_07 :heavy_check_mark: AC 5 ms 4 MB
g++ near_pow2_00 :heavy_check_mark: AC 108 ms 53 MB
g++ near_pow2_01 :heavy_check_mark: AC 113 ms 53 MB
g++ near_pow2_02 :heavy_check_mark: AC 119 ms 53 MB
g++ near_pow2_03 :heavy_check_mark: AC 137 ms 53 MB
g++ near_pow2_04 :heavy_check_mark: AC 136 ms 53 MB
g++ pow_rN_equal_1_00 :heavy_check_mark: AC 146 ms 54 MB
g++ pow_rN_equal_1_01 :heavy_check_mark: AC 217 ms 71 MB
g++ pow_rN_equal_1_02 :heavy_check_mark: AC 25 ms 11 MB
g++ random_00 :heavy_check_mark: AC 204 ms 69 MB
g++ random_01 :heavy_check_mark: AC 221 ms 71 MB
g++ random_02 :heavy_check_mark: AC 30 ms 15 MB
g++ small_00 :heavy_check_mark: AC 6 ms 4 MB
g++ small_01 :heavy_check_mark: AC 6 ms 4 MB
g++ small_02 :heavy_check_mark: AC 6 ms 4 MB
g++ y0_00 :heavy_check_mark: AC 46 ms 8 MB
Back to top page