牛客多校第七场J(线性dp)

思路:首先,子段模k余0可以转化为sumi ≡ sumj (mod k),就是两个sum值在模意义下相等,由于模意义下sum值为0~k-1,那么我们可以确定阶段,i表示已经放完模意义下sum值为0~i-1的数,然后我们需要刚好为t的贡献,如果有x个sum在模k意义下相等,那么产生的贡献为,此时我们需要知道位置的信息,还需要知道产生的贡献,于是就把这两个信息放在状态中.

于是就表示已经放完模意义下sum值为0~i-1的数, 当前放第模意义下为i的数,已经放了j个位置,产生的贡献为k的方案数.然后就可以状态转移了.

这里有两点要注意:
1.放的是sum数组模意义下的值,不是原数组的值

2.放模k余0时,默认有一个sum[0] = 0,所以贡献为(i + 1) * i / 2

代码:

#include <bits/stdc++.h>
// #define int long long
#define IOS ios::sync_with_stdio(false), cin.tie(0) 
#define ll long long 
// #define double long double
#define ull unsigned long long 
#define PII pair<int, int> 
#define PDI pair<double, int> 
#define PDD pair<double, double> 
#define debug(a) cout << #a << " = " << a << endl 
#define point(n) cout << fixed << setprecision(n)
#define all(x) (x).begin(), (x).end() 
#define mem(x, y) memset((x), (y), sizeof(x)) 
#define lbt(x) (x & (-x)) 
#define SZ(x) ((x).size()) 
#define inf 0x3f3f3f3f 
#define INF 0x3f3f3f3f3f3f3f3f
namespace nqio{const unsigned R = 4e5, W = 4e5; char *a, *b, i[R], o[W], *c = o, *d = o + W, h[40], *p = h, y; bool s; struct q{void r(char &x){x = a == b && (b = (a = i) + fread(i, 1, R, stdin), a == b) ? -1 : *a++;} void f(){fwrite(o, 1, c - o, stdout); c = o;} ~q(){f();}void w(char x){*c = x;if (++c == d) f();} q &operator >>(char &x){do r(x);while (x <= 32); return *this;} q &operator >>(char *x){do r(*x); while (*x <= 32); while (*x > 32) r(*++x); *x = 0; return *this;} template<typename t> q&operator>>(t &x){for (r(y),s = 0; !isdigit(y); r(y)) s |= y == 45;if (s) for (x = 0; isdigit(y); r(y)) x = x * 10 - (y ^ 48); else for (x = 0; isdigit(y); r(y)) x = x * 10 + (y ^ 48); return *this;} q &operator <<(char x){w(x);return *this;}q &operator<< (char *x){while (*x) w(*x++); return *this;}q &operator <<(const char *x){while (*x) w(*x++); return *this;}template<typename t> q &operator<< (t x) {if (!x) w(48); else if (x < 0) for (w(45); x; x /= 10) *p++ = 48 | -(x % 10); else for (; x; x /= 10) *p++ = 48 | x % 10; while (p != h) w(*--p);return *this;}}qio; }using nqio::qio;
using namespace std;
const int N = 70, MOD = 998244353;
int n, k, t;
ll f[N][N][N * N], C[N][N];
void prework() {
	for (int i = 0; i <= 64; ++i) C[i][0] = 1;
	C[1][1] = 1;
	for (int i = 2; i <= 64; ++i)
		for (int j = 1; j <= i; ++j)
			C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % MOD;
}
void solve() {
	prework();
	qio >> n >> k >> t;
	for (int i = 0; i <= n; ++i)
		f[0][i][i * (i + 1) / 2] = C[n][i];
	//f[i][j][l]表示已经考虑完0~i-1,已经填了j个位置,已经有l个godness
	for (int i = 1; i < k; ++i) {
		for (int j = 0; j <= n; ++j) {
			for (int l = 0; l <= min(t, (j + 1) * j / 2); ++l)
				for (int select = 0; select <= j; ++select) {
					int gap = select * (select - 1) / 2;
					if (l - gap < 0) break;
					f[i][j][l] = (f[i][j][l] + f[i - 1][j - select][l - gap] * C[n - (j - select)][select]) % MOD;
				}
		}
	}
	qio << f[k - 1][n][t] % MOD << "\n";
}
signed main()  {
	int T = 1;
	while (T--) solve();
}