All with Pairs
题目大意
给定 n 个字符串,求所有字符串中前缀与后缀相等的个数与前后缀的长度的平方的和。如样例,匹配长度为1,2,3的分别有4,4,1个,所以答案为 4 * 12 + 4 * 22 +1 * 32 = 29
实现代码
#include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <map>
#include <vector>
#define ll long long
#define inf 1<<30
#define ull unsigned long long
using namespace std;
const int M = 1e5 + 100;
const int N = 1e6 + 100;
const ull mod = 998244353;
string s[M];//本来用了char,但是不用string的动态存储,这个会爆空间啊
int nxt[N], cur[N];
map<unsigned long long, int> mp;
void getnxt(string w) {
int len = w.size(), k = -1;
nxt[0] = -1;
for (int i = 1; i < len; i++) {
while (k > -1 && w[k + 1] != w[i]) k = nxt[k];
if (w[k + 1] == w[i]) k++;
nxt[i] = k;
}
}
void puthash(string a) {
int len = a.size();
ull sum = 0, p = 1;
for (int i = len - 1; i >= 0; i--) {
sum += (a[i] - 'a' + 1) * p;
p *= 233;
mp[sum]++;
}
}
int main() {
int n;
ll ans = 0;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> s[i], puthash(s[i]);//存入后缀
for (int i = 1; i <= n; i++) {
int len = s[i].size();
ull t = 0;
for (int j = 0; j < len; j++) {
t = t * 233 + (s[i][j] - 'a' + 1);
cur[j] = mp[t];
}//存入前缀信息
getnxt(s[i]);//得到前缀函数
for (int j = 0; j < len; j++) {
if (nxt[j] >= 0) cur[nxt[j]] -= cur[j];//若有更长的前缀已经匹配,对应次长对前缀应该去掉
}
for (int j = 0; j < len; j++) {
ans += cur[j] % mod * (j + 1) % mod * (j + 1) % mod;
ans %= mod;//按照题意存入答案,并mod
}
}
cout << ans << endl;
}