bzoj4044: [Cerc2014] Virus synthesis 回文自动机

bzoj4044: [Cerc2014] Virus synthesis

Description

Viruses are usually bad for your health. How about fighting them with… other viruses? In
this problem, you need to find out how to synthesize such good viruses.
We have prepared for you a set of strings of the letters A, G, T and C. They correspond to the
DNA nucleotide sequences of viruses that we want to svnthesize, using the following operations:
* Adding a nucleotide either to the beginning or the end of the existing sequence
* Replicating the sequence, reversing the copied piece, and gluing it either to the beginmng or
to the end of the original (so that e.g., AGTC can become AGTCCTGA or CTGAAGTC).
We’re concerned about efficiency, since we have very many such sequences, some of them verv
long. Find a wav to svnthesize them in a mmimum number of operations.
你要用ATGC四个字母用两种操作拼出给定的串：
1.将其中一个字符放在已有串开头或者结尾
2.将已有串复制，然后reverse，再接在已有串的头部或者尾部
一开始已有串为空。求最少操作次数。
len<=100000

Input

The first line of input contains the number of test cases T. The descriptions of the test cases
follow:
Each test case consists of a single line containing a non-empty string. The string uses only
the capital letters A, C, G and T and is not longer than 100 000 characters.

Output

For each test case, output a single line containing the minimum total number of operations
necessary to construct the given sequence.

Sample Input

4
AAAA
AGCTTGCA
AAGGGGAAGGGGAA
AAACAGTCCTGACAAAAAAAAAAAAC

Sample Output

3
8
6
18

分析

很巧妙的回文自动机+Dp。
血赚的肯定是reverse操作。
reverse操作必定出回文串，并且长度是偶数。
设$f_p$为构造出这个回文串上的最小步数
$ans=min(len+f_p-len_p,len)$
还有就是$f_p=len_p(p = 2k+1,k \in N)$
这样子的话转移为求$f_p,p=2k, k \in N$
首先，注意到回文串最后一步必定是reverse
所以假设回文串$p$头尾去掉是回文串$q$的，把p翻转前加一个字母得到。
$f_p=f_q+1$
还有一种情况把$p$的一半当成我们要求的模板串，得到和ans类似的转移
$f_p=\frac{len_p}{2}+f_q-len_q+1$
注意$q$是不超过$p$长度一半的子回文串。
q q <script type="math/tex" id="MathJax-Element-2603">q</script>用回文树维护一下，这题就切了。

代码

/**************************************************************
    Problem: 4044
    User: 2014lvzelong
    Language: C++
    Result: Accepted
    Time:4072 ms
    Memory:4436 kb
****************************************************************/

#include<cstdio>
#include<algorithm>
const int N = 1e5 + 10;
char s[N];
int fa[N], len[N], f[N], q[N], las[N], ch[N][4], n, last, sz;
int F(int p) {for(;s[n - len[p] - 1] != s[n]; p = fa[p]); return p;}
int idx(char ch){
    if(ch == 'A') return 0;
    if(ch == 'T') return 1;
    if(ch == 'C') return 2;
    if(ch == 'G') return 3;
}
void Init(int p, int l, int f) {
    ch[p][0] = ch[p][1] = ch[p][2] = ch[p][3] = 0;
    len[p] = l; fa[p] = f;
}
void Extend(int c) {
    int p = F(last);
    if(!ch[p][c]) {
        int np = ++sz; Init(ch[p][c] = np, len[p] + 2, ch[F(fa[p])][c]);
        if(len[np] <= 2) las[np] = fa[np];
        else {
            int x;
            for(x = las[p]; s[n - len[x] - 1] != s[n] || (len[x] + 2 << 1) > len[np]; x = fa[x]) ;
            las[np] = ch[x][c];
        }
    } last = ch[p][c];
}
void Build() {
    last = 0; sz = 1; n = 0; char ch = getchar();
    for(;ch < 'A' || ch > 'Z'; ch = getchar());
    for(;ch >= 'A' && ch <= 'Z'; ch = getchar()) Extend(s[++n] = idx(ch));
}
int main() {
    int T; scanf("%d", &T); 
    for(;T--;) {
        Init(0, 0, 1); Init(1, -1, 0); f[0] = fa[0] = 1; s[0] = -1;
        Build(); for(int i = 1;i <= sz; ++i) if(len[i] & 1) f[i] = len[i];
        int L, R, ans = n; q[L = R = 1] = 0;
        for(int u = q[L];L <= R; u = q[++L]) {
            for(int i = 0; i < 4; ++i) 
            if(ch[u][i]) {
                int v = ch[u][i];
                f[v] = std::min(f[u] + 1, len[v] / 2 + f[las[v]] - len[las[v]] + 1);
                ans = std::min(ans, f[v] + n - len[v]);
                q[++R] = v;
            }
        }
        printf("%d\n", ans);
    }
    return 0;
}