【Codeforces 547 E】Mike and Friends（Ac自动机 / 树状数组）

传送门
不知道为什么会是$div1E$

显然建出$ac$自动机
显然一个操作对应的就是$l,r$对应的所有串在$trie$上所有点加$1$
然后询问$fail$树上$x$对应位置的子树的和

离线下来用树状数组维护即可

#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 ll readll(){
    char ch=gc();
    ll 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 int readstring(char *s){
	int top=0;char ch=gc();
	while(isspace(ch))ch=gc();
	while(!isspace(ch)&&ch!=EOF)s[++top]=ch,ch=gc();
	return top;
}
template<typename tp>inline void chemx(tp &a,tp b){a<b?a=b:0;}
template<typename tp>inline void chemn(tp &a,tp b){a>b?a=b:0;}
cs int N=200005;
int n,q,dfn;
int tr[N];
#define lb(x) (x&(-x))
inline void update(int p,int k){
	for(;p;p-=lb(p))tr[p]+=k;
}
inline int qry(int p,int res=0){
	for(;p<=dfn;p+=lb(p))res+=tr[p];
	return res;
}
inline int query(int l,int r){
	return qry(l)-qry(r+1);
}
#undef lb
namespace Ac{
	int nxt[N][26],fail[N],tot,ps[N],fa[N];
	vector<int> e[N];
	inline void insert(char *s,int pos,int len){
		int p=0;
		for(int i=1;i<=len;i++){
			int c=s[i]-'a';
			if(!nxt[p][c])nxt[p][c]=++tot,fa[tot]=p;
			p=nxt[p][c];
		}
		ps[pos]=p;
	}
	inline void buildfail(){
		queue<int> q;
		for(int i=0;i<26;i++)
			if(nxt[0][i])q.push(nxt[0][i]);
		while(!q.empty()){
			int p=q.front();q.pop();
			for(int c=0;c<26;c++){
				int v=nxt[p][c];
				if(!v)nxt[p][c]=nxt[fail[p]][c];
				else fail[v]=nxt[fail[p]][c],q.push(v);
			}
		}
	}
	int in[N],out[N];
	void dfs(int u){
		in[u]=++dfn;
		for(int &v:e[u]){
			dfs(v);
		}
		out[u]=dfn;
	}
	inline void buildtree(){
		for(int i=1;i<=tot;i++)e[fail[i]].pb(i);
		dfs(0);
	}
	inline void add(int u){
		u=ps[u];
		while(u)update(in[u],1),u=fa[u];
	}
	inline int calc(int x){
		return query(in[ps[x]],out[ps[x]]);
	}
}
char s[N];
struct ask{
	int p,id,c;
	ask(int a=0,int b=0,int _c=0):p(a),id(b),c(_c){}
};
vector<ask> qr[N];
int ans[500005];
int main(){
	#ifdef Stargazer
	freopen("lx.in","r",stdin);
	#endif
	n=read(),q=read();
	for(int i=1,l;i<=n;i++)
	l=readstring(s),Ac::insert(s,i,l);
	Ac::buildfail();
	Ac::buildtree();
	for(int i=1;i<=q;i++){
		int l=read(),r=read(),x=read();
		qr[l-1].pb(ask(x,i,-1)),qr[r].pb(ask(x,i,1));
	}
	for(int i=1;i<=n;i++){
		Ac::add(i);
		for(ask &x:qr[i]){
			ans[x.id]+=x.c*Ac::calc(x.p);
		}
	}
	for(int i=1;i<=q;i++)cout<<ans[i]<<'\n';
	return 0;
}