poj 3691

DNA repair

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 2936		Accepted: 1297

Description

Biologists finally invent techniques of repairing DNA that contains segments causing kinds of inherited diseases. For the sake of simplicity, a DNA is represented as a string containing characters 'A', 'G' , 'C' and 'T'. The repairing techniques are simply to change some characters to eliminate all segments causing diseases. For example, we can repair a DNA "AAGCAG" to "AGGCAC" to eliminate the initial causing disease segments "AAG", "AGC" and "CAG" by changing two characters. Note that the repaired DNA can still contain only characters 'A', 'G', 'C' and 'T'.

You are to help the biologists to repair a DNA by changing least number of characters.

Input

The input consists of multiple test cases. Each test case starts with a line containing one integers  N (1 ≤  N ≤ 50), which is the number of DNA segments causing inherited diseases.
The following  N lines gives  N non-empty strings of length not greater than 20 containing only characters in "AGCT", which are the DNA segments causing inherited disease.
The last line of the test case is a non-empty string of length not greater than 1000 containing only characters in "AGCT", which is the DNA to be repaired.

The last test case is followed by a line containing one zeros.

Output

For each test case, print a line containing the test case number( beginning with 1) followed by the
number of characters which need to be changed. If it's impossible to repair the given DNA, print -1.

 

Sample Input

2
AAA
AAG
AAAG    
2
A
TG
TGAATG
4
A
G
C
T
AGT
0

Sample Output

Case 1: 1
Case 2: 4
Case 3: -1

Source

2008 Asia Hefei Regional Contest Online by USTC

分析：听说是AC自动机+DP，不懂啊。。。看完某牛的题解和程序，就懒得写了改了改。。。太懒了

解题报告：http://www.cnblogs.com/woodfish1988/archive/2008/10/03/1303492.html

 

题目大意是说给定一个长度最大为1000的仅由A,T,C,G四个字符组成的字符串，要求改变最少的字符个数，使得得到的字符串中不含有任意预先给定的一系列子串。

 一般都会想到用动态规划，但是怎么DP是个问题，怎么设计状态。换个角度，我们要最终的字符串不含有任意模板串，这个涉及到多串匹配的知识。我们知道，可以建立一个有限状态自动机DFA来判断一个字符串中是否还有某些模板串。关于多模板串的DFA的建立，可以利用字符串前缀函数特殊的性质，建立一个TRIE图（具体建立方法可以参见相关论文）。这样，给定一个字符串，就可以在这个TRIE图中沿相应的边转移，如果途经一个危险节点，也就是目标串中出现了一个模板串。所以，给定一个模板串，如果在TRIE图中“走”的过程中没有到达过危险节点，那么这个字符串就符合要求。

现在来看原题，要求把一个字符串改变最小的字符数，使得最终的字符串符合要求。由于模板串不变，DFA也没有变化，所以我们这样DP：设dp[i][j]表示到了目标串的第i个字符，并且走到了自动机的状态点j，中途没有经过任何危险结点，所改变的字符串的最小个数。具体DP过程也是比较简单的。直接看代码就差不多了。最后的答案就是min{dp[len][j]} (len是目标串的长度,j是自动机中的一个状态点，并且状态j不是目标状态)

贴一下我改完后的吧，跟没改似地：

#include <stdio.h> #include <string.h> const int maxn=1000; const int mnd=480; int trie[mnd][4],pre[mnd],q[mnd],dp[maxn][mnd],nodes; bool v[mnd]; char str[maxn]; inline int get(char c) { switch(c) { case 'A':return 0; case 'G':return 1; case 'C':return 2; case 'T':return 3; } } inline bool build_trie() { char words[30]; int i,j,d,len,p,m; scanf("%d",&m); if(m==0) return false; memset(trie,0,sizeof(trie)); memset(v,1,sizeof(v)); memset(pre,0,sizeof(pre)); memset(q,0,sizeof(q)); for(nodes=1,i=0; i<m; ++i) { scanf("%s",words); len=strlen(words); for(p=1,j=0; j<len; ++j) { if(trie[p][d=get(words[j])]==0)trie[p][d]=++nodes; p=trie[p][d]; if(!v[p])break; } v[p]=0; } return true; } inline void build_graph() { int l=0,r=0,i,g; for(i=0; i<4; i++) if(trie[1][i])pre[q[++r]=trie[1][i]]=1;else trie[1][i]=1; while(l<r) { g=q[++l]; v[g]&=v[pre[g]]; if(v[g]) for(i=0; i<4; ++i) if(trie[g][i])pre[q[++r]=trie[g][i]]=trie[pre[g]][i]; else trie[g][i]=trie[pre[g]][i]; } } inline void gmin(int& a,int b) { if(a==-1||a>b) a=b; } int main() { int cases=0,len,i,j,k,w,ans; while(build_trie()) { build_graph(); scanf("%s",str); len=strlen(str); memset(dp,-1,sizeof(dp)); if(v[trie[1][w=get(str[0])]])dp[0][trie[1][w]]=0; for(i=0; i<4; ++i) if(w!=i&&v[trie[1][i]])dp[0][trie[1][i]]=1; for(i=1; i<len; ++i) for(j=1,w=get(str[i]); j<=nodes; ++j) if(dp[i-1][j]!=-1) { if(v[trie[j][w]]) gmin(dp[i][trie[j][w]],dp[i-1][j]); for(k=0; k<4; ++k) if(w!=k&&v[trie[j][k]]) gmin(dp[i][trie[j][k]],dp[i-1][j]+1); } for(ans=-1,i=1; i<=nodes; ++i) if(v[i]&&dp[len-1][i]!=-1)gmin(ans,dp[len-1][i]); printf("Case %d: %d/n",++cases,ans); } return 0; }