This documentation is automatically generated by competitive-verifier/competitive-verifier
// @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/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
| Env | Name | Status | Elapsed | Memory |
|---|---|---|---|---|
| g++ | example_00 |
|
3 ms | 4 MB |
| g++ | example_01 |
|
2 ms | 4 MB |
| g++ | max_random_00 |
|
202 ms | 53 MB |
| g++ | max_random_01 |
|
208 ms | 53 MB |
| g++ | max_random_02 |
|
209 ms | 53 MB |
| g++ | nar_0_00 |
|
3 ms | 4 MB |
| g++ | nar_0_01 |
|
2 ms | 4 MB |
| g++ | nar_0_02 |
|
2 ms | 4 MB |
| g++ | nar_0_03 |
|
2 ms | 4 MB |
| g++ | nar_0_04 |
|
2 ms | 4 MB |
| g++ | nar_0_05 |
|
2 ms | 4 MB |
| g++ | nar_0_06 |
|
2 ms | 4 MB |
| g++ | nar_0_07 |
|
2 ms | 4 MB |
| g++ | near_pow2_00 |
|
99 ms | 31 MB |
| g++ | near_pow2_01 |
|
101 ms | 31 MB |
| g++ | near_pow2_02 |
|
109 ms | 31 MB |
| g++ | near_pow2_03 |
|
140 ms | 47 MB |
| g++ | near_pow2_04 |
|
139 ms | 47 MB |
| g++ | pow_rN_equal_1_00 |
|
138 ms | 48 MB |
| g++ | pow_rN_equal_1_01 |
|
172 ms | 55 MB |
| g++ | pow_rN_equal_1_02 |
|
24 ms | 11 MB |
| g++ | random_00 |
|
162 ms | 52 MB |
| g++ | random_01 |
|
177 ms | 55 MB |
| g++ | random_02 |
|
27 ms | 12 MB |
| g++ | small_00 |
|
2 ms | 4 MB |
| g++ | small_01 |
|
2 ms | 4 MB |
| g++ | small_02 |
|
2 ms | 4 MB |
| g++ | y0_00 |
|
45 ms | 8 MB |