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$

Discussions

About Discussions

The discussion section is only for posting: Editorials, General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues. Submitting multiple issues may cause your account to be banned.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.