CF954I 哈希

暴力枚举集合划分，然后字符串哈希更新答案

#include <bits/stdc++.h>
/*
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
*/
using namespace std;

const double eps = 1e-10;
const double pi = 3.1415926535897932384626433832795;
const double eln = 2.718281828459045235360287471352;

#define f(i, a, b) for (int i = a; i <= b; i++)
#define scan(x) scanf("%d", &x)
#define mp make_pair
#define pb push_back
#define lowbit(x) (x&(-x))

#define fi first
#define se second
#define SZ(x) int((x).size())
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define summ(a) (accumulate(all(a), 0ll))

typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;

using ll=long long;

const ull P=13;
const int maxn=125009; 
ull ha[maxn],po[maxn],tar;
vector<char> ls;
string s,t;
int ans[maxn],tot,cov[386];

ull gethash(int l,int r){
    return ha[r]-ha[l-1]*po[r-l+1];
}

int id(char a){return lower_bound(all(ls),a)-ls.begin()+1;}

void gen_ha(){
    tar=0;
    for(auto it:t)tar=tar*P+cov[id(it)];
    for(int i=1;i<=s.size();++i)ha[i]=ha[i-1]*P+cov[id(s[i-1])];
}

void solve(){
    for(int i=1;i+t.size()-1<=s.size();++i){
        if(gethash(i,i+t.size()-1)==tar){
            ans[i]=min(ans[i],(int)(ls.size())-tot);
        }
    }
}

void dev(int dep){
    if(dep>ls.size()){
        gen_ha();
        solve();
        return;
    }
    cov[dep]=++tot;
    dev(dep+1);
    tot-=1;
    for(int i=1;i<=tot;++i){
        cov[dep]=i;
        dev(dep+1);
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    memset(ans,0x3f,sizeof(ans));
    set<char> se;
    cin>>s>>t;
    for(auto it:s)se.insert(it);
    for(auto it:t)se.insert(it);
    for(auto it:se)ls.push_back(it);
    sort(all(ls));
    po[0]=1;
    for(int i=1;i<=s.length();++i)po[i]=P*po[i-1];
    dev(1);
    for(int i=1;i+t.size()-1<=s.size();++i)cout<<ans[i]<<" \n"[i+t.size()-1==s.size()];
    return 0;
}