Palindrome(manacher+bit

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e6+10;
int Ma[N],Mp[N];
int cnt[N];
struct node{
    int n,c[N];
    void init(int _n){n=_n;for(int i=1;i<=n;i++)c[i]=0;}
    int lowbit(int x){return x&(-x);}
    int getsum(int x){
        int ans=c[x];
        while((x-=lowbit(x))>0) ans+=c[x];
        return ans;
    }
    void add(int x,int v){
        c[x]+=v;
        while((x+=lowbit(x))<=n) c[x]+=v;
    }
}bit1;
void Manacher(char s[],int len){
    int l=0;
    Ma[l++]='$';
    Ma[l++]='#';
    for(int i=0;i<len;i++){
        Ma[l++]=s[i];
        Ma[l++]='#';
    }
    Ma[l]=0;
    int mx=0,id=0;
    for(int i=0;i<l;i++){
        Mp[i]=mx>i?min(Mp[2*id-i],mx-i):1;
        while(Ma[i+Mp[i]]==Ma[i-Mp[i]]) Mp[i]++;
        if(i+Mp[i]>mx){
            mx=i+Mp[i];
            id=i;
        }
    }
    for(int i=2;i<2*len+2;i+=2){
        cnt[i/2]=Mp[i]-1;cnt[i/2]/=2;
//        cout<<cnt[i/2]<<endl;
    }
}
char ch[N];int t;
bool cmp(pair<int,int> a,pair<int,int> b){
    return a.first>b.first;
}
int32_t main(){
    scanf("%lld",&t);
    while(t--){
        scanf("%s",ch);int sz=strlen(ch);
        Manacher(ch,sz);
        bit1.init(N-1);
        vector<pair<int,int>> q;
        for(int i=1;i<=sz;i++){
            if(cnt[i]) q.push_back({i-cnt[i],i});
        }
        sort(q.begin(),q.end(),cmp);
//        cout<<q.size()<<endl;
        long long ans=0;
        for(int i=1;i<=sz;i++){
            if(cnt[i]==0) continue;
            while(q.size()&&q.back().first<=i){
                    int pos=q.back().second;
                    q.pop_back();
                    bit1.add(pos,1);
            }
            ans+=(long long)(bit1.getsum(i+cnt[i])-bit1.getsum(i));
//            cout<<ans<<endl;
        }
//        cout<<bit1.getsum(N-1)<<endl;
        cout<<ans<<endl;
    }

}