题目链接:点这里~
题目大意
给你一个字符串s,问你有多少个前缀si满足si是由两个一摸一样的且是回文串拼接成的,这两个串可以是首尾共享一个字符。字符串长2e5。
思路
只有一组样例,长度也才2e5,可以直接顺着跑一边哈希,倒着跑一边哈希,然后直接枚举长度,分两种情况判断即可。
ac代码
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(time(0));
#define io cin.tie(0);ios::sync_with_stdio(false);
#define ok(x, y) x >= 1 && x <= n && y >= 1 && y <= m
#define debug(x) cout<<#x<<"="<<x<<endl
#define lowbit(x) x&(-x)
#define pii pair<int,int>
#define mk make_pair
#define ll long long
#define ull unsigned long long
#define rs p<<1|1
#define ls p<<1
const int maxn = 2e5 + 5;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const ll INF = 1e18;
const int bas = 233;
inline ll read(){
ll p=0,f=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){p=(p<<1)+(p<<3)+(c^48),c=getchar();}
return f*p;
}
char a[maxn];
ull ha1[maxn], ha2[maxn], p[maxn];
ull get1(int l, int r){ //获取子串1
return ha1[r] - ha1[l - 1] * p[r - l + 1];
}
ull get2(int l, int r){ //获取子串2
return ha2[l] - ha2[r + 1] * p[r - l + 1];
}
void solve(){
cin >> (a + 1);
int len = strlen(a + 1);
p[0] = 1;
for(int i = 1; i <= len; i ++){
ha1[i] = ha1[i - 1] * bas + a[i] - 'a' + 1;
p[i] = p[i - 1] * bas;
}
for(int i = len; i >= 1; i --)
ha2[i] = ha2[i + 1] * bas + a[i] - 'a' + 1;
int ans = 0;
for(int i = 1; i <= len; i ++){
int l = 1, r = i;
if(get1(l, r) != get2(l, r)) continue; //左边字符串本身就不是回文串
if(r + r <= len && get1(l, r) == get1(l + r, r + r)) ans ++; //左右相邻不共享
if(r + r - 1 <= len && get1(l, r) == get1(l + r - 1, r + r - 1)) ans ++; //左右相邻贡献
}
cout << ans << endl;
}
int main(){
// freopen("1.in", "r", stdin);
// freopen("std.out", "w", stdout);
// cout << fixed << setprecision(6)
io;
int t = 1;
// cin >> t;
while(t --){
solve();
}
return 0;
}