类似于之前发的indeed tokyo设计密码那个题。
只不过这个的模式串有多个,所以需要AC自动机。
dp的过程都类似。
这里要求的是改变的最小代价,其实和设计一样从0开始考虑,只不过当要加入的字母和母串不一样的时候代价➕1
这里定义
f
[
i
]
[
j
]
f[i][j]
f[i][j] 为到母串第i个位置位置,处在安全节点j的最小改变数
则
f
[
i
+
1
]
[
p
]
=
m
i
n
0
<
k
<
4
(
f
[
i
]
[
j
]
+
t
)
p
∈
t
r
[
j
]
[
k
]
f[i+1][p] = min_{0<k<4}(f[i][j] + t) \ p\in tr[j][k]
f[i+1][p]=min0<k<4(f[i][j]+t) p∈tr[j][k]
t
=
g
e
t
(
s
t
r
[
i
+
1
]
)
!
=
k
t = get(str[i+1]) \ != k
t=get(str[i+1]) !=k
g
e
t
(
c
h
a
r
c
)
get(char\ c)
get(char c)是字符对应的编号
#include <iostream>
#include <cstring>
using namespace std;
const int N = 1010;
const char *DNA = "ATCG";
inline int get(char c) {
if (c == 'A') return 0;
else if (c == 'T') return 1;
else if (c == 'C') return 2;
else return 3;
}
char str[N];
int tr[1010][4], nxt[1010], idx;
bool flg[1010];
void insert() {
int p = 0;
for (int i = 0; str[i]; i++) {
int q = get(str[i]);
if (!tr[p][q]) tr[p][q] = ++idx;
p = tr[p][q];
}
flg[p] = true;
}
int que[1010], hh, tt;
void build() {
hh = tt = 0;
for (int i = 0; i < 4; i++)
if (tr[0][i]) que[tt++] = tr[0][i];
while(hh < tt) {
int t = que[hh++];
for (int i = 0; i < 4; i++) {
int p = tr[t][i];
if (!p) tr[t][i] = tr[nxt[t]][i];
else {
nxt[p] = tr[nxt[t]][i];
que[tt++] = p;
flg[p] |= flg[nxt[p]];
}
}
}
}
int f[1010][1010];
void solve(int cnt) {
build();
f[0][0] = 0;
int m = strlen(str+1);
for (int i = 0; i < m; i++) {
for (int j = 0; j <= idx; j++) {
for (int k = 0; k < 4; k++) {
int p = tr[j][k];
int t = get(str[i+1]) != k;
if (!flg[p]) f[i+1][p] = min(f[i][j] + t, f[i+1][p]);
}
}
}
int res = 0x3f3f3f3f;
for (int i = 0; i <= idx; i++) res = min(res, f[m][i]);
if (res >= 0x3f3f3f3f) res = -1;
cout << "Case " << cnt << ": " << res << endl;
}
int n;
int main() {
ios::sync_with_stdio(0);
int cnt = 1;
while(1) {
cin >> n;
if (n == 0) break;
memset(tr, 0, sizeof tr);
memset(nxt, 0, sizeof nxt);
memset(flg, 0, sizeof flg);
memset(f, 0x3f, sizeof f);
idx = 0;
for (int i = 0; i < n; i++) {
cin >> str;
insert();
}
cin >> (str+1);
solve(cnt);
cnt++;
}
return 0;
}