This documentation is automatically generated by competitive-verifier/competitive-verifier
// @brief Multipoint Evaluation
#define PROBLEM "https://judge.yosupo.jp/problem/multipoint_evaluation"
#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, m;
cin >> n >> m;
polyn::Vector f(n), x(m);
copy_n(istream_iterator<base>(cin), n, begin(f));
copy_n(istream_iterator<base>(cin), m, begin(x));
polyn(polyn(f).eval(x)).print(m);
}
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
| Env | Name | Status | Elapsed | Memory |
|---|---|---|---|---|
| g++ | example_00 |
|
5 ms | 4 MB |
| g++ | example_01 |
|
4 ms | 4 MB |
| g++ | issue_1287_00 |
|
4 ms | 4 MB |
| g++ | issue_1287_cpp_00 |
|
603 ms | 61 MB |
| g++ | issue_1287_cpp_01 |
|
602 ms | 61 MB |
| g++ | max_random_00 |
|
618 ms | 61 MB |
| g++ | max_random_01 |
|
601 ms | 61 MB |
| g++ | random_00 |
|
159 ms | 24 MB |
| g++ | random_01 |
|
129 ms | 18 MB |
| g++ | random_02 |
|
504 ms | 50 MB |
| g++ | zero_00 |
|
5 ms | 4 MB |