A14840 | Shuffle
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given a binary string (i. e. a string consisting of characters 0 and/or 1) $s$ of length $n$ . You can perform the following operation with the string $s$ at most once: choose a substring (a contiguous subsequence) of $s$ having exactly $k$ characters 1 in it, and shuffle it (reorder the characters in the substring as you wish).
Calculate the number of different strings which can be obtained from $s$ by performing this operation at most once.
Calculate the number of different strings which can be obtained from $s$ by performing this operation at most once.
输入格式
The first line contains two integers $n$ and $k$ ( $2 \le n \le 5000$ ; $0 \le k \le n$ ).
The second line contains the string $s$ of length $n$ , consisting of characters 0 and/or 1.
The second line contains the string $s$ of length $n$ , consisting of characters 0 and/or 1.
输出格式
Print one integer — the number of different strings which can be obtained from $s$ by performing the described operation at most once. Since the answer can be large, output it modulo $998244353$ .
输入输出样例
输入 #1
7 2 1100110
输出 #1
16
输入 #2
5 0 10010
输出 #2
1
输入 #3
8 1 10001000
输出 #3
10
输入 #4
10 8 0010011000
输出 #4
1
Some strings you can obtain in the first example:
- to obtain 0110110, you can take the substring from the $1$ -st character to the $4$ -th character, which is 1100, and reorder its characters to get 0110;
- to obtain 1111000, you can take the substring from the $3$ -rd character to the $7$ -th character, which is 00110, and reorder its characters to get 11000;
- to obtain 1100101, you can take the substring from the $5$ -th character to the $7$ -th character, which is 110, and reorder its characters to get 101.
In the second example, $k = 0$ so you can only choose the substrings consisting only of 0 characters. Reordering them doesn't change the string at all, so the only string you can obtain is 10010.
- to obtain 0110110, you can take the substring from the $1$ -st character to the $4$ -th character, which is 1100, and reorder its characters to get 0110;
- to obtain 1111000, you can take the substring from the $3$ -rd character to the $7$ -th character, which is 00110, and reorder its characters to get 11000;
- to obtain 1100101, you can take the substring from the $5$ -th character to the $7$ -th character, which is 110, and reorder its characters to get 101.
In the second example, $k = 0$ so you can only choose the substrings consisting only of 0 characters. Reordering them doesn't change the string at all, so the only string you can obtain is 10010.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted