CF1093F.Vasya and Array

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Vasya has got an array consisting of $n$ integers, and two integers $k$ and $len$ in addition. All numbers in the array are either between $1$ and $k$ (inclusive), or equal to $-1$ . The array is good if there is no segment of $len$ consecutive equal numbers.

Vasya will replace each $-1$ with some number from $1$ to $k$ (inclusive) in such a way that the resulting array is good. Tell him the number of ways to do this replacement. Since the answer may be large, print it modulo $998244353$ .

输入格式

The first line contains three integers $n, k$ and $len$ ( $1 \le n \le 10^5, 1 \le k \le 100, 1 \le len \le n$ ).

The second line contains $n$ numbers — the array. Each number is either $-1$ or between $1$ and $k$ (inclusive).

输出格式

Print one integer — the number of ways to replace each $-1$ with some number from $1$ to $k$ (inclusive) so the array is good. The answer may be large, so print it modulo $998244353$ .

输入输出样例

输入#1
```
5 2 3
1 -1 1 -1 2
```
输出#1
```
2
```
输入#2
```
6 3 2
1 1 -1 -1 -1 -1
```
输出#2
```
0
```

输入#3

10 42 7
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1

输出#3

645711643

说明/提示

Possible answers in the first test:

$[1, 2, 1, 1, 2]$ ;
$[1, 2, 1, 2, 2]$ .

There is no way to make the array good in the second test, since first two elements are equal.

There are too many answers in the third test, so we won't describe any of them.

首页