【Codeforces 1183 H. Subsequences (hard version)】dp

cf570H
cf579E题的升级版 k是1e12 所以必须用dp
dp[i][j] 代表到 i 删除了 j个字符的种类数
那么 dp[i][j] = dp[i-1][j-1]+dp[i-1][j]
但是如果 aba 你删除 ba 和之前删除 ab 的情况是一样的
所以我们要把之前的情况回溯 利用一个pre 数组回溯删除
为了不爆边界 如果dp值大于k dp值等于k

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);

/*namespace sgt
{
    #define mid ((l+r)>>1)

    #undef mid
}*/
const int MAX_N = 105;
ll dp[MAX_N][MAX_N];
int pre[35];
char str[MAX_N];

int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n;
    ll k;
    scanf("%d%lld",&n,&k);
    scanf("%s",str+1);
    dp[0][0] = 1;
    for(int i = 1;i<=n;++i)
    {
        dp[i][0] = 1;
        for(int j = 1;j<=i;++j)
        {
            dp[i][j]+=dp[i-1][j-1]+dp[i-1][j];
            if(pre[str[i]-'a'+1]&&j-(i-pre[str[i]-'a'+1])>=0) dp[i][j] -= dp[pre[str[i]-'a'+1]-1][j-(i-pre[str[i]-'a'+1])];
            if(dp[i][j]>k) dp[i][j] = k;
        }
        pre[str[i]-'a'+1] = i;
    }
    ll ans = 0;
    for(int i = 0;i<=n;++i)
    {
        ans+=min(k,dp[n][i])*i;
        k-=dp[n][i];
        if(k<=0) break;
    }
    if(k>0) printf("-1\n");
    else printf("%lld\n",ans);
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}