CodeForces - 452E Three strings

题意：

给定三个字符串 $s_1,s_2,s_3$，问对每个 l ( l ≤ min ⁡ { ∣ s 1 ∣ , ∣ s 2 ∣ , ∣ s 3 ∣ } ) l(l \leq \min\{|s_1|, |s_2|, |s_3|\}) l(l≤min{∣s1​∣,∣s2​∣,∣s3​∣})，有多少个三元组 $(i_1,i_2,i_3)$ 满足 $s_k[i_k,\cdots ,i_k+l-1](k=1,2,3)$ 相同。$(\sum s_i\le 3\times 10^5)$

链接：

https://vjudge.net/problem/CodeForces-452E

解题思路：

枚举三元组显然不实际，考虑枚举 $s_k[i_k,\cdots ,i_k+l-1](k=1,2,3)$，即下标 $i$ 开始的子串，或者说下标 $i+l-1$ 结束的子串，拿三个串建立起（广义）后缀自动机，那么就是枚举每个自动机结点（每个等价类代表的子串）。

那么，对当前结点 $u$，包含该子串结尾的就是其子树内的串，该结点贡献就是三个字符串在该结点 $right$ 集合大小的乘积，枚举每个结点统计答案即可。

参考代码：

#include<bits/stdc++.h>
 
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define sz(a) ((int)a.size())
#define pb push_back
#define lson (rt << 1)
#define rson (rt << 1 | 1)
#define gmid (l + r >> 1)
const int maxn = 6e5 + 5;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;

char s[3][maxn];
int nxt[maxn][26], par[maxn], len[maxn], tp[maxn], rk[maxn];
ll sum[maxn][3], ans[maxn];
int n, cnt, last;

int add(int l){

	++cnt; len[cnt] = l; return cnt;
}

void init(){

	cnt = 0; last = add(0);
}

void insert(char ch){

	int t = ch - 'a', p = last, cur;
	if(nxt[p][t]){

		int q = nxt[p][t];
		if(len[q] == len[p] + 1) { last = q; return; }
		int nq = add(len[p] + 1); last = nq;
		memcpy(nxt[nq], nxt[q], sizeof nxt[q]);
		par[nq] = par[q], par[q] = nq;
		while(p && nxt[p][t] == q) nxt[p][t] = nq, p = par[p];
		return;
	}
	cur = last = add(len[p] + 1);
	while(p && !nxt[p][t]) nxt[p][t] = cur, p = par[p];
	if(!p) { par[cur] = 1; return; }
	int q = nxt[p][t];
	if(len[q] == len[p] + 1) { par[cur] = q; return; }
	int nq = add(len[p] + 1);
	memcpy(nxt[nq], nxt[q], sizeof nxt[q]);
	par[nq] = par[q], par[q] = par[cur] = nq;
	while(p && nxt[p][t] == q) nxt[p][t] = nq, p = par[p];
}

void rsort(){

	for(int i = 0; i <= cnt; ++i) tp[i] = 0;
	for(int i = 1; i <= cnt; ++i) ++tp[len[i]];
	for(int i = 1; i <= cnt; ++i) tp[i] += tp[i - 1];
	for(int i = cnt; i >= 1; --i) rk[tp[len[i]]--] = i;
}

int main() {

	ios::sync_with_stdio(0); cin.tie(0);
	init();
	int lim = inf;
	for(int i = 0; i < 3; ++i){

		cin >> s[i] + 1;
		int m = strlen(s[i] + 1);
		lim = min(lim, m);
		for(int j = 1; j <= m; ++j){

			insert(s[i][j]);
			++sum[last][i];
		}
		last = 1;
	}
	rsort();
	for(int i = cnt; i >= 2; --i){

		int u = rk[i];
		sum[par[u]][0] += sum[u][0];
		sum[par[u]][1] += sum[u][1];
		sum[par[u]][2] += sum[u][2];
		ll tmp = sum[u][0] * sum[u][1] % mod * sum[u][2] % mod;
		(ans[len[par[u]] + 1] += tmp) %= mod;
		(ans[len[u] + 1] += -tmp + mod) %= mod;
	}
	for(int i = 1; i <= lim; ++i){

		(ans[i] += ans[i - 1]) %= mod;
		cout << ans[i] << " ";
	}
	cout << endl;
	return 0;
}