传送门
题解:
广义SAM水题,不是很清楚那些在线构建的为什么能过,应该是出题人没有卡,卡成
O
(
n
n
)
O(n\sqrt n)
O(nn)还是绰绰有余的,这样DarkBZOJ上的AC代码基本全灭。
8 e 5 8e5 8e5你给我说根号能过?
还有,字符串大小直接开8e6,题面没有说大小,我就因为这个RE了若干次。
代码:
#include<bits/stdc++.h>
#define ll long long
#define re register
#define cs const
namespace IO{
static cs int Rlen=1<<22|1;
static char buf[Rlen],*p1,*p2;
inline char gc(){return (p1==p2)&&(p2=(p1=buf)+fread(buf,1,Rlen,stdin),p1==p2)?EOF:*p1++;}
inline char peek(){return (p1==p2)&&(p2=(p1=buf)+fread(buf,1,Rlen,stdin),p1==p2)?EOF:*p1;}
inline char ga(){while(!isalpha(peek()))++p1;return *p1++;}
inline int get_s(char *s){
int len=0;char c;
while(isspace(c=gc()));
while(s[len++]=c,!isspace(c=gc())&&c!=EOF);
s[len]='\0';return len;
}
template<typename T>
inline T get(){
char c;T num;
while(!isdigit(c=gc()));num=c^48;
while(isdigit(c=gc()))num=(num+(num<<2)<<1)+(c^48);
return num;
}
inline int gi(){return get<int>();}
}
using namespace IO;
using std::cerr;
using std::cout;
cs int N=8e5+7,M=N<<1;
int n;
char s[N*10];int L;
int son[M][26],fa[M],len[M],siz[M],bin[N],now;
inline int push_back(int p,int c){
if(son[p][c])return son[p][c];
int cur=++now;len[cur]=len[p]+1;
for(;p&&!son[p][c];p=fa[p])son[p][c]=cur;
if(!p)fa[cur]=1;
else if(len[son[p][c]]==len[p]+1)fa[cur]=son[p][c];
else {
int nq=++now,q=son[p][c];
len[nq]=len[p]+1;
memcpy(son[nq],son[q],sizeof son[q]);
fa[nq]=fa[q];fa[q]=fa[cur]=nq;
for(;p&&son[p][c]==q;p=fa[p])son[p][c]=nq;
}
return cur;
}
int ps[M];
ll f[M];
inline void radix_sort(){
for(int re i=1;i<=now;++i)++bin[len[i]];
for(int re i=1;i<=n;++i)bin[i]+=bin[i-1];
for(int re i=1;i<=now;++i)ps[bin[len[i]]--]=i;
for(int re i=now;i;--i)siz[fa[ps[i]]]+=siz[ps[i]];
for(int re i=1;i<=now;++i)f[i]=(ll)(len[i]-len[fa[i]])*siz[i];
for(int re i=1;i<=now;++i)f[ps[i]]+=f[fa[ps[i]]];
}
inline void solve(){
ll ans=0;L=get_s(s+1);
for(int re i=1,u=1,nl=0;i<=L;++i){
int c=s[i]-'a';
while(u&&!son[u][c])nl=len[u=fa[u]];
if(!u)u=1,nl=0;
else {
u=son[u][c],++nl;
ans+=f[fa[u]]+(ll)(nl-len[fa[u]])*siz[u];
}
}
cout<<ans<<"\n";
}
namespace Trie{
int son[N][26],siz[N],tot;
inline int ins(int u,int c){return !son[u][c]?son[u][c]=++tot:son[u][c];}
inline void build(){
std::queue<int> q;
q.push(1);now=ps[1]=1;
while(!q.empty()){
int u=q.front();q.pop();
for(int re i=0;i<26;++i)
if(son[u][i]){
int v=son[u][i];
ps[v]=push_back(ps[u],i);
q.push(v);::siz[ps[v]]+=siz[v];
}
}
}
}
signed main(){
#ifdef zxyoi
freopen("pty.in","r",stdin);
#endif
n=gi();ps[1]=1;Trie::tot=1;
for(int re i=2;i<=n;++i){
int f=gi();char c=ga()-'a';
ps[i]=Trie::ins(ps[f],c);
++Trie::siz[ps[i]];
}
Trie::build();radix_sort();solve();
return 0;
}