A16044 | Count Supersequences
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given an array $a$ of $n$ integers, where all elements $a_i$ lie in the range $[1, k]$ . How many different arrays $b$ of $m$ integers, where all elements $b_i$ lie in the range $[1, k]$ , contain $a$ as a subsequence? Two arrays are considered different if they differ in at least one position.
A sequence $x$ is a subsequence of a sequence $y$ if $x$ can be obtained from $y$ by the deletion of several (possibly, zero or all) elements.
Since the answer may be large, print it modulo $10^9 + 7$ .
A sequence $x$ is a subsequence of a sequence $y$ if $x$ can be obtained from $y$ by the deletion of several (possibly, zero or all) elements.
Since the answer may be large, print it modulo $10^9 + 7$ .
输入格式
The first line of the input contains a single integer $t$ ( $1 \le t \le 10^4$ ) — the number of test cases. The description of the test cases follows.
The first line of each test case contains three integers $n$ , $m$ , $k$ ( $1 \le n \le 2\cdot 10^5$ , $n \le m \le 10^9$ , $1 \le k \le 10^9$ ) — the size of $a$ , the size of $b$ , and the maximum value allowed in the arrays, respectively.
The next line of each test case contains $n$ integers $a_1, a_2, \ldots a_n$ ( $1\le a_i \le k$ ) — the elements of the array $a$ .
It is guaranteed that the sum of $n$ over all test cases does not exceed $2\cdot 10^5$ .
The first line of each test case contains three integers $n$ , $m$ , $k$ ( $1 \le n \le 2\cdot 10^5$ , $n \le m \le 10^9$ , $1 \le k \le 10^9$ ) — the size of $a$ , the size of $b$ , and the maximum value allowed in the arrays, respectively.
The next line of each test case contains $n$ integers $a_1, a_2, \ldots a_n$ ( $1\le a_i \le k$ ) — the elements of the array $a$ .
It is guaranteed that the sum of $n$ over all test cases does not exceed $2\cdot 10^5$ .
输出格式
For each test case, output a single integer — the number of suitable arrays $b$ , modulo $10^9+7$ .
输入输出样例
输入 #1
7 1 1000000 1 1 3 4 3 1 2 2 5 7 8 1 2 3 4 1 6 6 18 18 2 2 5 2 16 1 10 2 1 8 10 1234567 1 1 2 1 2 2 2 1 5 1000000000 1000000000 525785549 816356460 108064697 194447117 725595511
输出 #1
1 9 1079 1 1023 906241579 232432822
For the first example, since $k=1$ , there is only one array of size $m$ consisting of the integers $[1, k]$ . This array ( $[1, 1, \ldots, 1]$ ) contains the original array as a subsequence, so the answer is 1.
For the second example, the $9$ arrays are $[1, 1, 2, 2]$ , $[1, 2, 1, 2]$ , $[1, 2, 2, 1]$ , $[1, 2, 2, 2]$ , $[1, 2, 2, 3]$ , $[1, 2, 3, 2]$ , $[1, 3, 2, 2]$ , $[2, 1, 2, 2]$ , $[3, 1, 2, 2]$ .
For the fourth example, since $m=n$ , the only array of size $m$ that contains $a$ as a subsequence is $a$ itself.
For the second example, the $9$ arrays are $[1, 1, 2, 2]$ , $[1, 2, 1, 2]$ , $[1, 2, 2, 1]$ , $[1, 2, 2, 2]$ , $[1, 2, 2, 3]$ , $[1, 2, 3, 2]$ , $[1, 3, 2, 2]$ , $[2, 1, 2, 2]$ , $[3, 1, 2, 2]$ .
For the fourth example, since $m=n$ , the only array of size $m$ that contains $a$ as a subsequence is $a$ itself.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted