FZU2275 Game（kmp

暑假wa的题了,,,看见vj的attempt痕迹打算挨个补了，简单kmp题，判断bob的串是不是全为0或者是alice的字串就好了

 #include<algorithm>
 #include<iostream>
 using namespace std;
 const int N = 1e6+;
 int nt[N];
 string tt,ss;
 bool KMP()
 {
     int s = ss.size(),t = tt.size();
     if(s>t)return false;
     nt[] = -;
     int num = ;
     for(int i = ,j = -;i < s;){
         if(j==-||ss[i]==ss[j]){
             i++;j++;nt[i]=j;
         }
         else j = nt[j];
     }
     for(int i = ,j=;i<t;){
         if(j==-||ss[j]==tt[i]){
             i++;j++;
         }
         else j = nt[j];
         if(j==s){
             return true;
         }
     }
     return false;
 }
 int main()
 {
     ios::sync_with_stdio();
     int T;
     cin>>T;
     while(T--){
         cin>>tt>>ss;
         int ll = ss.size();
         bool flag = ;
         for(int i = ;i < ll;++i){
             if(ss[]!='')flag = ;
         }
         if(flag==){
             puts("Alice");continue;
         }
         for(int i = ;i <=ll;++i)nt[i] = ;
         if(KMP()){
             puts("Alice");continue;
         }
         reverse(ss.begin(),ss.end());
         for(int i = ;i <=ll;++i)nt[i] = ;
         if(KMP()){
             puts("Alice");continue;
         }
         puts("Bob");

     }
     return ;
 }