QOJ.ac

QOJ

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

#4812. Counting Sequence

統計

给定整数 $n$ 和 $c$。 一个序列 $a_1, a_2, \dots, a_m$ 是好的,当且仅当: 对于所有 $1 \le i \le m$,都有 $a_i > 0$, 对于所有 $1 \le i \le m - 1$,都有 $|a_{i+1} - a_i| = 1$, * $\sum_{i=1}^m a_i = n$。

对于一个好的整数序列 $a_1, a_2, \dots, a_m$,我们定义 $$f(a) = \sum_{i=1}^{m-1} [a_i > a_{i+1}]$$ 即 $f(a)$ 表示在所有 $1 \le i \le m - 1$ 中满足 $a_i > a_{i+1}$ 的下标 $i$ 的个数。我们定义序列 $a$ 的权值为 $c^{f(a)}$。

你的任务是计算所有好的序列的权值之和,对 $998\,244\,353$ 取模。

输入格式

第一行包含两个整数 $n$ 和 $c$ ($1 \le n \le 3 \cdot 10^5$, $0 \le c < 998\,244\,353$)。

输出格式

输出答案对 $998\,244\,353$ 取模的结果。

样例

输入 1

5 3

输出 1

8

输入 2

1 0

输出 2

1

输入 3

2022 39

输出 3

273239559

说明

在第一个样例中,所有好的序列如下:

$a$ $f(a)$ $c^{f(a)}$
$[5]$ 0 1
$[2, 3]$ 0 1
$[3, 2]$ 1 3
$[2, 1, 2]$ 1 3

因此答案为 $1 + 1 + 3 + 3 = 8$。

Discussions

About Discussions

The discussion section is only for posting: 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.
  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.