POJ 1625 Censored! AC自动机+DP+大数-白红宇

POJ 1625 Censored! AC自动机+DP+大数

阅读量：5873 次

发布时间：2019-06-19

本文共 1497 字，大约阅读时间需要 4 分钟。

//#pragma comment(linker, "/STACK:1024000000,1024000000")#include
      
       #include
       
        #include
        
         #include
         
          #include
          
           #include
           
            #include
            
             #include
             
              #include
              
               #include
               #include
                
                 #include
                 
                  #include
                  
                   #include
                   
                    using namespace std;typedef long long ll;typedef unsigned long long ull;typedef pair
                    
                      pii;#define pb(a) push_back(a)#define INF 0x1f1f1f1f#define lson idx<<1,l,mid#define rson idx<<1|1,mid+1,r#define PI 3.1415926535898template
                     
                       T min(const T& a,const T& b,const T& c) { return min(min(a,b),min(a,c));}template
                      
                        T max(const T& a,const T& b,const T& c) { return max(max(a,b),max(a,c));}void debug() {#ifdef ONLINE_JUDGE#else freopen("d:\\in.txt","r",stdin); // freopen("d:\\out1.txt","w",stdout);#endif}int getch() { int ch; while((ch=getchar())!=EOF) { if(ch!=' '&&ch!='\n')return ch; } return EOF;}struct BIG{ int bit[15]; int len; BIG(){len=1;bit[0]=0;} BIG(int x){bit[0]=x;len=1;} BIG one() { BIG res; res.bit[0]=1; return res; } BIG operator += (const BIG &ans) { int nlen=max(len,ans.len); int next=0; for(int i=0;i
                       
                        =0;i--) printf("%09d",bit[i]); // printf("\n"); }};const int MAX_NODE=222;const int SIGMA_SIZE = 50;int ch[MAX_NODE][SIGMA_SIZE];int fail[MAX_NODE];int val[MAX_NODE];int sz;int n,m,p;BIG dp[MAX_NODE][55];int vis[MAX_NODE][55];int id[256];void init(int n){ memset(id,-1,sizeof(id)); char buf[55]; scanf("%s",buf); for(int i=0;i