UVA_11468_Substring_(AC自动机+概率动态规划)

描述

---

https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2463

给出一些子串.然后给出一些字符,以及每个字符出现的概率.现在用这些字符组成一个长度为s的字符串,问之前给出的子串都没有在这个字符串中出现的概率是多少.

分析

---

边选字母边匹配.只要前面的字串都不能匹配成功即可.用前面的那些子串造出个AC自动机,然后在上面跑.用match数组表示每个点是否是单词节点,根据题意,只要不是单词节点都可以跑.然后AC自动机在get_fail的时候把没有的边补上.

 #include <bits/stdc++.h>
 using namespace std;

 const int maxt=+,maxk=+,maxl=+,maxnode=*+,type=++;
 int t,k,l,n,kase;
 char p[maxk][];
 double pro[type];
 inline int idx(char c){
     if(c>=''&&c<='') return c-'';
     if(c>='a'&&c<='z') return c-'a'+;
     return c-'A'+;
 }
 struct Aho_Corasick{
     int ch[maxnode][type];
     int f[maxnode];
     double dp[maxnode][maxl];
     bool match[maxnode];
     int sz;
     void init(){
         sz=;
         match[]=false;
         memset(pro,,sizeof pro);
         memset(ch[],,sizeof ch[]);
         memset(dp,-,sizeof dp);
     }
     void insert(char *s){
         int u=;
         for(;*s;s++){
             int c=idx(*s);
             if(!ch[u][c]){
                 memset(ch[++sz],,sizeof ch[sz]);
                 match[sz]=false;
                 ch[u][c]=sz;
             }
             u=ch[u][c];
         }
         match[u]=true;
     }
     void get_fail(){
         queue <int> q;
         f[]=;
         for(int c=;c<type;c++){
             int u=ch[][c];
             if(u){ f[u]=; q.push(u); }
         }
         while(!q.empty()){
             int r=q.front(); q.pop();
             for(int c=;c<type;c++){
                 int u=ch[r][c];
                 if(!u){ ch[r][c]=ch[f[r]][c]; continue; }
                 q.push(u);
                 int v=f[r];
                 f[u]=ch[v][c];
                 match[u]|=match[f[u]];
             }
         }
     }
     double get_pro(int u,int l){
         if(!l) return 1.0;
         if(dp[u][l]>=) return dp[u][l];
         double &ans=dp[u][l];
         ans=0.0;
         for(int c=;c<type;c++)if(!match[ch[u][c]]) ans+=pro[c]*get_pro(ch[u][c],l-);
         return ans;
     }
 }ac;
 int main(){
     scanf("%d",&t);
     while(t--){
         ac.init();
         scanf("%d",&k);
         for(int i=;i<=k;i++){
             scanf("%s",p[i]);
             ac.insert(p[i]);
         }
         ac.get_fail();
         scanf("%d",&n);
         for(int i=;i<=n;i++){
             char c;
             while(c=getchar(),c=='\n');
             scanf("%lf",&pro[idx(c)]);
         }
         scanf("%d",&l);
         printf("Case #%d: %lf\n",++kase,ac.get_pro(,l));
     }
     return ;
 }

11468
Substring
Given a set of pattern strings, and a text, you have to find, if any of the pattern is a substring of the
text. If any of the pattern string can be found in text, then print ‘yes’, otherwise ‘no’ (without quotes).
But, unfortunately, thats not what is asked here.
The problem described above, requires a input file generator. The generator generates a text of
length L, by choosing L characters randomly. Probability of choosing each character is given as priori,
and independent of choosing others.
Now, given a set of patterns, calculate the probability of a valid program generating “no”.
Input
First line contains an integer T , the number of test cases. Each case starts with an integer K, the
number of pattern strings. Next K lines each contain a pattern string, followed by an integer N ,
number of valid characters. Next N lines each contain a character and the probability of selecting that
character, p i . Next an integer L, the length of the string generated. The generated text can consist of
only the valid characters, given above.
There will be a blank line after each test case.
Output
For each test case, output the number of test case, and the probability of getting a “no”.
Constraints:
• T ≤ 50
• K ≤ 20
• Length of each pattern string is between 1 and 20
• Each pattern string consists of only alphanumeric characters (a to z, A to Z, 0 to 9)
• Valid characters are all alphanumeric characters
•
∑
p i = 1
• L ≤ 100
Sample Input
2
1
a
2
a 0.5
b 0.5
2
2
ab
2
a 0.2
b 0.8
2
Sample Output
Case #1: 0.250000
Case #2: 0.840000