[ARC107D] Number of Multisets 题解 DP

[ARC107D] Number of Multisets

传送门

Problem Statement

You are given two positive integers $N$ and $K$. How many multisets of rational numbers satisfy all of the following conditions?

• The multiset has exactly $N$ elements and the sum of them is equal to $K$.
• Each element of the multiset is one of $1,\frac{1}{2},\frac{1}{4},\frac{1}{8},\dots$. In other words, each element can be represented as $\frac{1}{2^i}(i=0,1,\dots )$.

The answer may be large, so print it modulo $998244353$.

Constraints

• $1\le K\le N\le 3000$
• All values in input are integers.

Input

Input is given from Standard Input in the following format:

N K

Output

Print the number of multisets of rational numbers that satisfy all of the given conditions modulo $998244353$.

Sample Input 1

4 2

Sample Output 1

2

The following two multisets satisfy all of the given conditions:

• $1,\frac{1}{2},\frac{1}{4},\frac{1}{4}$
• $\frac{1}{2},\frac{1}{2},\frac{1}{2},\frac{1}{2}$

Sample Input 2

2525 425

Sample Output 2

687232272

题目翻译

给出两个正整数 $N$，$K$。求有多少有理数集满足以下所有条件：

• 集合有且只有 $N$ 个元素，并且元素和为 $K$；
• 每个元素须可表示为 $\frac{1}{2^i}(i\in N)$。

答案可能很大，请将其对 $998244353$ 取 mod。

注明

$以上来自Atcoder，翻译来源：洛谷。$

解题思路

非常容易想到 DP。用 $D{P}_{i,j}$ 表示选了 $i$ 个数，和为 $j$ 的情况。由题意可知，选的数只能是 $2^{-x},x\in N$，所以一定满足 $i\ge j$。

考虑如何转移：

• 显然，边界为 $D{P}_{0,0}=0$；
• 若选 $1$ 放入，则显然有 $D{P}_{i,j}=D{P}_{i-1,j-1}$；
• 若选 $2^{-x},x\in N_{+}$ 放入，可以考虑将原先选的数乘 $2$，在加上 一个数使得满足和为 $2\times k$（C Wx：在序列末尾加上一个 $1$，再将整个序列除以 $2$），得出 $D{P}_{i,j}+=D{P}_{i,j\times 2},j\times 2\ge 0$。

（C Wx：注意一定要讲这题的坑点！）
注意：$j$ 要从大到小处理，因为要先求出 $j$ 较小时的 $D{P}_{i,j\times 2}$ 的值。

AC Code

#include<bits/stdc++.h>
using namespace std;
int N, K;
int DP[5005][5005];
signed main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0), cin >> N >> K, DP[0][0] = 1;
	for (register int i = 1; i <= N; ++i) for (register int j = i; j >= 1; j--) {
			DP[i][j] = DP[i - 1][j - 1];
			if ((j << 1) <= i) DP[i][j] = (DP[i][j] + DP[i][j << 1] > 998244353 ? DP[i][j] + DP[i][j << 1] - 998244353 : DP[i][j] + DP[i][j << 1]);
		}
	cout << DP[N][K] << endl;
	return 0;
}

（C Wx：我用滚动数组跑出了最优解！）