Codeforces Round 877 (Div. 2) E

E. Count Supersequences

You are given an array aa 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?

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.

$n,m,k(1\le n\le 2\cdot 10^5,n\le m\le 10^9,1\le k\le 10^9)$

题意

给你一个长度为$n$数组$a$，数字从$1-k$中选，让你求以$a$为子序列的长度为$m$的数组$b$的个数，$b$数组同样从$1-k$中选。

思路

首先我们定义$d{p}_{i,j}$为长度为$i$，已经匹配了$a$的前$j$个字母的方案数

如果第$i$位选则 $d{p}_{i,j}+=d{p}_{i-1,j-1}$;

如果第$i$位不选，则
$$d{p}_{i,j}=\{\begin{array}{ll}d{p}_{i-1,j}\ast (k-1),& i!=n\\ d{p}_{i-1,j}\ast k& i==n\end{array}$$
这样可以解决$m$在$1e6$以下的问题，但是如果$m=1e9$，就需要优化，首先我们通过观察原式发现与$a_i$没有关系，那我们就将所有数设置成$1$，问题就转化成了从$m$个数里面挑$n$个一样的数的方案数，那正着求比较难求，我们考虑容斥，用总方案数减去不符合的$n-1$个$1$的方案数

答案就是$k^m-{\sum }_{i=0}^{n-1}\left(\genfrac{}{}{0ex}{}{m}{i}\right)\ast (k-1{)}^{m-i}$

那如何快速求$\left(\genfrac{}{}{0ex}{}{m}{i}\right)$ 呢？

$\left(\genfrac{}{}{0ex}{}{m}{0}\right)=1$

$\left(\genfrac{}{}{0ex}{}{m}{i}\right)=\frac{m(m-1)...(m-i+1)}{i(i-1)...1}=\frac{m-i+1}{i}\left(\genfrac{}{}{0ex}{}{m}{i-1}\right)i>1$

C[0] = 1;
for(int i = 1; i <= n; i ++){
	C[i] = C[i - 1] * (m - i + 1LL) % MOD * qmi(i, MOD - 2, MOD) % MOD;
}
int ans = qmi(K, m, MOD);
for(int i = 0; i < n; i ++){
	ans = ((ans - C[i] * qmi(K - 1, m - i, MOD) % MOD) % MOD + MOD) % MOD;
}