题意:求本质不同的子串的个数
写这题就为了赛前测一下SAM板子,毕竟是个裸得不能再裸的裸题了,然而,居然出问题了..................
问题出在初始化,一开始为了节省时间,是对每个节点一个一个去初始化-----fail[cnt] = -1;
然而这样对于数据有多组的问题,可能就会出问题,在debug了近1h后,把这里改成了memset就过了,难受啊
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize(4)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6 + 100000;
const int M = 1e6 + 100000;
struct SAM
{
static const int KN = N << 1;
static const int KM = 30;
int fail[KN], net[KN][KM], len[KN], cnt, root;
int newnode(int _len)
{
memset(net[cnt], -1, sizeof(net[cnt]));
// fail[cnt] = -1;
len[cnt] = _len;
return cnt++;
}
void init()
{
cnt = 0;
memset(fail,-1,sizeof(fail));
root = newnode(0);
}
int add(int p, int x)
{
int np = newnode(len[p] + 1);
while(~p && net[p][x] == -1) net[p][x] = np, p = fail[p];
if(p == -1) fail[np] = root;
else
{
int q = net[p][x];
if(len[q] == len[p] + 1) fail[np] = q;
else
{
int nq = newnode(len[p] + 1);
memcpy(net[nq], net[q], sizeof(net[q]));
fail[nq] = fail[q];
fail[q] = fail[np] = nq;
while(~p && net[p][x] == q) net[p][x] = nq, p = fail[p];
}
}
return np;
}
void build(char *s, char ch)
{
int now = root;
for(int i = 0; s[i]; ++i) now = add(now, s[i] - ch);
}
int ord[KN], pri[KN];
void topo()
{
int maxVal=0;
memset(pri, 0, sizeof(pri));
for (int i = 0; i < cnt; ++i) maxVal = max(maxVal, len[i]), ++ pri[len[i]];
for (int i = 1; i <= maxVal; ++i) pri[i] += pri[i - 1];
for (int i = 0; i < cnt; ++i) ord[--pri[len[i]]] = i;
}
void gao()
{
ll ans=0;
for(int i=0;i<cnt;i++) ans+=len[i]-len[fail[i]];
printf("%lld\n",ans);
}
} sam;
char s[N];
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
sam.init();
scanf("%s",s);
sam.build(s, 'A');
sam.gao();
}
}