代码:
#include<bits/stdc++.h>
#pragma GCC optimize ("O2")
#define int long long
#define For(i,a,b) for(i=a;i<=b;i++)
#define FOR(i,a,b) for(i=a;i>=b;i--)
#define pb push_back
using namespace std;
const int N=5e5+10,Base=13331,mod=1061067769;
char s[N];
int base[N];
int pre[N],suf[N];
void init(int n){
int i;
For(i,1,n) pre[i]=(pre[i-1]*Base%mod+s[i])%mod;
FOR(i,n,1) suf[i]=(suf[i+1]*Base%mod+s[i])%mod;
}
int pre_hash(int l,int r){
if(l>r) return 0;
return (pre[r]-pre[l-1]*base[r-l+1]%mod+mod)%mod;
}
int suf_hash(int l,int r){
if(l>r) return 0;
return (suf[l]-suf[r+1]*base[r-l+1]%mod+mod)%mod;
}
bool solve(){
int i,j,n=strlen(s+1);
For(i,1,n/2) if(s[i]!=s[n+1-i]) break;
if(i>n/2) return 1;
For(j,i,n-i+1){
// cout<<j<<'\n';
if(j+1+(j-1)>n+1-i) break;
if(pre_hash(i,j)==pre_hash(n+1-j,n+1-i)&&pre_hash(j+1,n-j)==suf_hash(j+1,n-j)) return 1;
if(pre_hash(i,j)==pre_hash(j+1,j+1+(j-i))&&pre_hash(j+1+(j-i)+1,n-i+1)==suf_hash(j+1-(j-i)+1,n-i+1)) return 1;
}
FOR(j,n-i+1,i) if(j-(n+1-i-j+1)>=i&&pre_hash(j,n-i+1)==pre_hash(j-(n+1-i-j+1),j-1)&&pre_hash(i,j-(n+1-i-j+1)-1)==suf_hash(i,j-(n+1-i-j+1)-1)) return 1;
return 0;
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
int t,i;
base[0]=1;
For(i,1,5e5) base[i]=base[i-1]*Base%mod;
cin>>t;
while(t--){
cin>>(s+1);
init(strlen(s+1));
solve()?cout<<"Yes\n":cout<<"No\n";
}
return 0;
}