【POJ3691】 DNA repair （AC自动机+DP）

DNA repair

Time Limit: 2000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u

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

【题意】

　　已知一个DNA串和一些病毒DNA序列，求出最少改变DNA串中多少个字符，能使得串中不包含任意一个病毒序列。

【分析】

　　建AC自动机然后DP，不要走到有标记的点即可。

代码如下：

 #include<cstdio>

 #include<cstdlib>

 #include<cstring>

 #include<iostream>

 #include<algorithm>

 #include<queue>

 using namespace std;

 #define Maxn 3010

 #define Maxl 1010

 #define INF 0xfffffff

 int n;

 char s[];

 char ss[Maxl];

 struct node

 {

     int cnt,fail;

     bool mark;

     int son[];

 }t[Maxn];int tot;//=0;

 void upd(int x)

 {

     t[x].cnt=;t[x].mark=;

     memset(t[x].son,,sizeof(t[x].son));

 }

 int mymin(int x,int y) {return x<y?x:y;}

 void read_trie()

 {

     scanf("%s",s+);

     int len=strlen(s+);

     int now=;

     for(int i=;i<=len;i++)

     {

         int ind=s[i]-'A'+;

         if(ind==) ind=;

         else if(ind==) ind=;

         else if(ind==) ind=;

         if(!t[now].son[ind])

         {

             t[now].son[ind]=++tot;

             upd(tot);

         }

         now=t[now].son[ind];

         if(i==len) t[now].mark=;

     }

 }

 queue<int > q;

 // bool inq[Maxn];

 void build_AC()

 {

     while(!q.empty()) q.pop();

     q.push();//inq[0]=1;

     while(!q.empty())

     {

         int x=q.front();q.pop();

         for(int i=;i<=;i++)

         {

             if(t[x].son[i])

             {

                 t[t[x].son[i]].fail=x?t[t[x].fail].son[i]:;

                 q.push(t[x].son[i]);

             }

             else t[x].son[i]=t[t[x].fail].son[i];

             if(t[t[x].fail].mark) t[x].mark=;

         }

     }

 }

 int f[Maxn][Maxl];

 void dp()

 {

     scanf("%s",ss+);

     int len=strlen(ss+);

     for(int i=;i<=len;i++)

     {

         if(ss[i]=='C') ss[i]='B';

         else if(ss[i]=='G') ss[i]='C';

         else if(ss[i]=='T') ss[i]='D';

     }

     memset(f,,sizeof(f));

     f[][]=;

     for(int i=;i<=len;i++)

      for(int j=;j<=tot;j++) if(f[i-][j]<INF)

      {

          for(int k=;k<=;k++) if(!t[t[j].son[k]].mark)

          {

              if(ss[i]-'A'+==k)

               f[i][t[j].son[k]]=mymin(f[i][t[j].son[k]],f[i-][j]);

              else f[i][t[j].son[k]]=mymin(f[i][t[j].son[k]],f[i-][j]+);

          }

      }

     int ans=INF;

     for(int i=;i<=tot;i++) ans=mymin(f[len][i],ans);

     if(ans<=len) printf("%d\n",ans);

     else printf("-1\n");

 }

 void init()

 {

     tot=;

     upd();

     for(int i=;i<=n;i++)

     {

         read_trie();

     }

     build_AC();

 }

 int main()

 {

     int kase=;

     while()

     {

         scanf("%d",&n);

         if(n==) break;

         init();

         printf("Case %d: ",++kase);

         dp();

     }

     return ;

 }

[POJ3691]

2016-07-11 10:06:17

巴特西

【POJ3691】 DNA repair （AC自动机+DP）

最新文章

热门文章