【2020省选模拟】题解

T1：

一眼$SvT$上树
可以用树上后缀数组+单调栈或者广义$Sam$+虚树

我实现了树上后缀数组
也没什么细节
不过由于一个点会成为多个点的$2^i$级祖先
每次倍增时求$sa2$也要桶排一次
最后求$height$要在树上跳也只能$nlogn$求，为了方便就直接二分哈希做了
导致跑不过$Sam$

#include<bits/stdc++.h>
using namespace std;
#define cs const
#define re register
#define pb push_back
#define pii pair<int,int>
#define ll long long
#define fi first
#define se second
#define bg begin
cs int RLEN=1<<20|1;
inline char gc(){
    static char ibuf[RLEN],*ib,*ob;
    (ib==ob)&&(ob=(ib=ibuf)+fread(ibuf,1,RLEN,stdin));
    return (ib==ob)?EOF:*ib++;
}
inline int read(){
    char ch=gc();
    int res=0;bool f=1;
    while(!isdigit(ch))f^=ch=='-',ch=gc();
    while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
    return f?res:-res;
}
inline char readchar(){
	char ch=gc();
	while(isspace(ch))ch=gc();
	return ch;
}
#define ull unsigned long long
template<class tp>inline void chemx(tp &a,tp b){a<b?a=b:0;}
template<class tp>inline void chemn(tp &a,tp b){a>b?a=b:0;}
cs int N=100005;
int dep[N],fa[19][N];
ull has[19][N],pw[N];
cs ull bas=331;
vector<pii> e[N];
int n,m;
void dfs(int u){
	for(int i=1;i<19;i++)fa[i][u]=fa[i-1][fa[i-1][u]],has[i][u]=has[i-1][u]*pw[1<<(i-1)]+has[i-1][fa[i-1][u]];
	for(pii &x:e[u]){
		if(x.fi==fa[0][u])continue;
		dep[x.fi]=dep[u]+1,fa[0][x.fi]=u,has[0][x.fi]=x.se;
	//	cout<<has[0][x.fi]<<'\n';
		dfs(x.fi);
	}
}
inline int Lcp(int u,int v){
	int res=0;
	for(int i=18;~i;i--)if(min(dep[u],dep[v])>=(1<<i)){
		if(has[i][u]==has[i][v])res+=1<<i,u=fa[i][u],v=fa[i][v];
	}
	return res;
}
namespace Sa{
	int rk[N],sa[N],sa2[N],buc[N],ht[N],lg[N],st[19][N];
	int m;
	inline void Sort(){
		for(int i=0;i<=m;i++)buc[i]=0;
		for(int i=1;i<=n;i++)buc[rk[sa2[i]]]++;
		for(int i=1;i<=m;i++)buc[i]+=buc[i-1];
		for(int i=n;i>=1;i--)sa[buc[rk[sa2[i]]]--]=sa2[i];
	}
	inline void build(){
		m=28;
		for(int i=1;i<=n;i++)rk[i]=has[0][i],sa2[i]=i;
		Sort();
	//	for(int i=1;i<=n;i++)cout<<sa[i]<<" ";puts("");
		for(int tt=1,pos=0,l=0;tt<=n&&pos<n;tt<<=1,l++){
			pos=0;
			for(int j=0;j<=m;j++)buc[j]=0;
			for(int j=1;j<=n;j++)buc[rk[fa[l][sa[j]]]]++;
			for(int j=1;j<=m;j++)buc[j]+=buc[j-1];
			for(int j=n;j>=1;j--)sa2[buc[rk[fa[l][sa[j]]]]--]=sa[j];
			Sort();
			swap(rk,sa2);
			rk[sa[1]]=pos=1;
			for(int j=2;j<=n;j++)
			rk[sa[j]]=(sa2[sa[j]]==sa2[sa[j-1]]&&sa2[fa[l][sa[j]]]==sa2[fa[l][sa[j-1]]])?pos:++pos;
			m=pos;
		}
		for(int i=1;i<=n;i++)rk[sa[i]]=i;
		for(int i=2;i<=n;i++)lg[i]=lg[i>>1]+1;
		for(int i=2;i<=n;i++)ht[i]=Lcp(sa[i],sa[i-1]);//cout<<ht[i]<<'\n';
		for(int i=1;i<=n;i++)st[0][i]=ht[i];
		for(int i=1;(1<<i)<=n;i++)
		for(int j=1;j+(1<<i)-1<=n;j++)
		st[i][j]=min(st[i-1][j],st[i-1][j+(1<<(i-1))]);
	}
	inline int lcp(int x,int y){
		if(x==y)return dep[x];
		x=rk[x],y=rk[y];
		if(x>y)swap(x,y);x++;
		int t=lg[y-x+1];
		return min(st[t][x],st[t][y-(1<<t)+1]);
	}
	int a[N],val[N],l[N],r[N],stk[N],top;
	inline bool comp(int a,int b){return rk[a]<rk[b];}
	inline void solve(){
		int x=read();
		for(int i=1;i<=x;i++)a[i]=read();
		sort(a+1,a+x+1,comp),x--;
		for(int i=1;i<=x;i++)val[i]=lcp(a[i],a[i+1]);
		for(int i=1;i<=x;i++){
			while(top&&val[stk[top]]>=val[i])r[stk[top--]]=i;
			stk[++top]=i;
		}
		while(top)r[stk[top--]]=x+1;
		for(int i=x;i>=1;i--){
			while(top&&val[stk[top]]>val[i])l[stk[top--]]=i;
			stk[++top]=i;
		}
		while(top)l[stk[top--]]=0;
		ll res=0;
		for(int i=1;i<=x;i++)
		res+=1ll*val[i]*(i-l[i])*(r[i]-i);
		cout<<res<<'\n';
	}
}
int main(){
	n=read();
	for(int i=1;i<n;i++){
		int u=read(),v=read(),w=readchar()-'a'+1;
		e[u].pb(pii(v,w)),e[v].pb(pii(u,w));
	}
	pw[0]=1;
	for(int i=1;i<=n;i++)pw[i]=pw[i-1]*bas;
	dfs(1);
	Sa::build();
	m=read();
	while(m--)Sa::solve();
	return 0;
}

T2：

不会，也没看懂题解

T3：

开始想了一个$dp$
$f[i]$表示有$i$个位置需要断开
对每种字符做一次$dp$
枚举当前插入几个到之前要断开的位置和当前在连几个相同相邻的字符
不过复杂度只能做到$n^3$

不过直接高维容斥
对每种字符构建生成函数上记录容斥系数乘起来即可
复杂度$O(nlogn)$

#include<bits/stdc++.h>
using namespace std;
#define cs const
#define re register
#define pb push_back
#define pii pair<int,int>
#define ll long long
#define fi first
#define se second
#define bg begin
cs int RLEN=1<<20|1;
inline char gc(){
    static char ibuf[RLEN],*ib,*ob;
    (ib==ob)&&(ob=(ib=ibuf)+fread(ibuf,1,RLEN,stdin));
    return (ib==ob)?EOF:*ib++;
}
inline int read(){
    char ch=gc();
    int res=0;bool f=1;
    while(!isdigit(ch))f^=ch=='-',ch=gc();
    while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
    return f?res:-res;
}
template<class tp>inline void chemx(tp &a,tp b){a<b?a=b:0;}
template<class tp>inline void chemn(tp &a,tp b){a>b?a=b:0;}
cs int mod=1e9+7;
inline int add(int a,int b){return (a+=b)>=mod?(a-mod):a;}
inline int dec(int a,int b){a-=b;return a+(a>>31&mod);}
inline int mul(int a,int b){static ll r;r=1ll*a*b;return (r>=mod)?(r%mod):r;}
inline void Add(int &a,int b){(a+=b)>=mod?(a-=mod):0;}
inline void Dec(int &a,int b){a-=b,a+=a>>31&mod;}
inline void Mul(int &a,int b){static ll r;r=1ll*a*b;a=(r>=mod)?(r%mod):r;}
inline int ksm(int a,int b,int res=1){for(;b;b>>=1,Mul(a,a))(b&1)&&(Mul(res,a),1);return res;}
inline int Inv(int x){return ksm(x,mod-2);}
inline int fix(int x){return (x<0)?x+mod:x;}
cs int N=100005;
int n1,n2,n3,n4;
int fac[N],ifac[N];
inline int C(int n,int m){return n<m?0:mul(fac[n],mul(ifac[m],ifac[n-m]));}
#define poly vector<int>
inline poly calc(int n){
	poly a(n+1);
	for(int i=1;i<=n;i++){
		int now=mul(C(n-1,i-1),ifac[i]);
		if((n-i)&1)now=mod-now;
		a[i]=now;
	}
	return a;
}
inline poly operator *(poly a,poly b){
	int deg=a.size()+b.size()-1;
	poly c(deg,0);
	for(int i=0;i<a.size();i++)
	for(int j=0;j<b.size();j++)
	Add(c[i+j],mul(a[i],b[j]));
	return c;
}
int main(){
	fac[0]=ifac[0]=1;
	for(int i=1;i<N;i++)fac[i]=mul(fac[i-1],i);
	ifac[N-1]=Inv(fac[N-1]);
	for(int i=N-2;i;i--)ifac[i]=mul(ifac[i+1],i+1);
	n1=read(),n2=read(),n3=read(),n4=read();
	poly a(1,1);
	if(n1)a=a*calc(n1);
	if(n2)a=a*calc(n2);
	if(n3)a=a*calc(n3);
	if(n4)a=a*calc(n4);
	int res=0;
	for(int i=0;i<a.size();i++)Add(res,mul(fac[i],a[i]));
	cout<<res<<'\n';
	return 0;
}