马拉车+主席树

vjudge 3 H

H - Palindrome 传送门

Alice like strings, especially long strings. For each string, she has a special evaluation system to judge how elegant the string is. She defines that a string S1…3n−2S1…3n−2 is one-and-half palindromic if and only if it satisfies S[i]=S[2n−i]=S2n+i−2S[i]=S[2n−i]=S2n+i−2.For example, abcbabcabcbabc is one-and-half palindromic string, and abccbaabcabccbaabc is not. Now, Alice has generated some long strings. She ask for your help to find how many substrings which is one-and-half palindromic.

#pragma GCC optimize(3)
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 1e6+100;
int t,n;
char s[maxn],S[maxn];
int len[maxn];
int ls[maxn<<5],rs[maxn<<5],sum[maxn<<5],seg,root[maxn];
void build(int &p,int l,int r)
{
	p = ++seg;
	if(l == r)return;
	int mid = l + r >> 1;
	build(ls[p],l,mid);
	build(rs[p],mid+1,r);
}
void insert(int p1,int &p2,int l,int r,int x)
{
	p2=++seg;sum[p2]= sum[p1]+1;
	if(l==r)return;
	int mid = l + r >> 1;
	if(x<=mid){
		rs[p2]=rs[p1];
		insert(ls[p1],ls[p2],l,mid,x);
	}
	else{
		ls[p2]=ls[p1];
		insert(rs[p1],rs[p2],mid+1,r,x);
	}
	return;
}
ll query(int p1,int p2,int l,int r,int x)
{
	if(l>x)return 0;
	if(r<=x)return sum[p1]-sum[p2];
	if(l==r)return 0;
	int mid = l + r >> 1;
	int res = 0;
	res+=query(ls[p1],ls[p2],l,mid,x);
	if(x>mid) res+=query(rs[p1],rs[p2],mid+1,r,x);
	return res;
}
int main()
{
	scanf("%d",&t);
	while(t--)
	{
		scanf("%s",s);n = strlen(s);
		int l = 1;seg = 0;
		for(int i=0;s[i];i++){S[l++]='#';S[l++]=s[i];}
		S[l]='#';S[0]='!';
		int id=0,mx=0;
		for(int i=1;i<=l;i++)
		{
			if(i<mx)len[i]=min(len[id*2-i],mx-i);
			else len[i]=0;
			for(int j=len[i];j<i&&j+i<=l;j++)
			{
				if(S[j+i]!=S[i-j])break;
				len[i]=j;
			}
			if(i+len[i]>mx)
			{
				mx = i+len[i];
				id = i;
			}
		}
		build(root[0],0,n);
		for(int i=1;i<=n;i++)
		{
			len[i] = (len[i<<1]>>1);
			insert(root[i-1],root[i],0,n,i-len[i]);
		}
		ll ans=0;
		for(int i=1;i<=n;i++)
		if(len[i]>0)ans+=query(root[i+len[i]],root[i],0,n,i);
		printf("%lld\n",ans);
	}
}