1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
| #include <bits/stdc++.h>
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;
}
|