CF1183H(线性dp+简单的容斥)

题意：给定一个长度为 n 的字符串 以及 一个数字 k，规定串的每个子序列的价值为 ，现在要求你求出 个本质不同的子序列使得价值最小。

ps.本质不同 指的是：子序列的内容不同，而不是单纯的子序列的位置不同。

思路:显然,f[i][j]表示前i个字符产生的字符串产生长度为j的子序列一共有多少种,如果所有字符都不一样,那么f[i][j] = f[i - 1][j] + f[i - 1][j - 1], 但是有相同的字符,我们考虑容斥,如果这个字符有前驱,我们要减去f[pre[i] - 1][j - 1],因为这个字符和前驱组成的字符串本质上是一样的.

代码:

#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;
//f[i][j]表示前i个位置上,长度为j的子序列最多有多少种
//f[i][j] = f[i - 1][j] + f[i - 1][j - 1] - f[pre[i] - 1][j - 1]
const int N = 110;
int f[N][N], pre[N];
char s[N];
int n, k;
map<char, int> last;
signed main() {
	qio >> n >> k >> s + 1;
	for (int i = 1; i <= n; ++i) {
		if (last[s[i]])	pre[i] = last[s[i]];
		last[s[i]] = i;
	}
	for (int i = 0; i <= n; ++i) f[i][0] = 1;
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= i; ++j) {
			f[i][j] = f[i - 1][j - 1] + f[i - 1][j];
			if (pre[i])	f[i][j] -= f[pre[i] - 1][j - 1];
		}
	int ans = 0, tot = n;
	while (k && tot >= 1) {
		ans += min(f[n][tot], k) * (n - tot);
		k = max(k - f[n][tot], 0ll);
		--tot;
	}
	if (k > 1) return qio << -1 << "\n", 0;
	qio << ans + n * (k == 1) << '\n';
}