QOJ.ac

QOJ

Time Limit: 10 s Memory Limit: 1024 MB Total points: 100

#622. 多项式多点求值

统计

给定多项式 $F(z) = \sum_{i=0}^{n-1} f_iz^i$ 与 $m$ 个非负整数 $x_1,x_2,\cdots, x_m$。对每个 $1 \leq i \leq m$ 你需要计算 $f(x_i)$ 的值。

输入格式

第一行两个整数 $n, m$,描述多项式的次数为 $n-1$ 次,询问的数量为 $m$。

接下来一行 $n$ 个整数 $f_0, f_1, \cdots, f_{n-1}$

接下来 $m$ 行,每行一个整数 $x_i$,描述一组询问。

输出格式

输出 $m$ 行,每行一个整数,描述询问取模 $998,244,353$ 后的结果。

样例数据

样例输入

6 6
1 1 4 5 1 4
1
19
191
1919
810
1919810

样例输出

16
10070476
934460929
474354141
579687411
895765304

子任务

对于所有数据,$1 \leq n,m \leq 10^6$。

测试点 $n,m$
$1$ $100$
$2$ $5 \times 10^3$
$3$ $3 \times 10^4$
$4$ $10^5$
$5$ $10^6$
About Issues

We understand that our problem archive is not perfect. If you find any issues with the problem, including the statement, scoring configuration, time/memory limits, test cases, etc.

You may use this form to submit an issue regarding the problem. A problem moderator will review your issue and proceed it properly.

STOP! Before you submit an issue, please READ the following guidelines:

  1. This is not a place to publish a discussion, editorial, or requests to debug your code. Your issue will only be visible by you and problem moderators. Other users will not be able to view or reply your issues.
  2. Do not submit duplicated issues. If you have already submitted one, please wait for an moderator to review it. Submitting multiple issues will not speed up the review process and might cause your account to be banned.
  3. Issues must be filed in English or Chinese only.
  4. Be sure your issue is related to this problem. If you need to submit an issue regarding another problem, contest, category, etc., you should submit it to the corresponding page.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0

No issues in this category.