男人8题A题(后缀自动机+SG函数)

题解：因为要多个串到达尾部把T串，我们可以在某点到达的状态建成一个图然后 ，就是多个有向图的SG函数

#include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>
#include<vector>
#include<cstdio>
#include<cmath>
#include<set>
#include<map>
#include<cstdlib>
#include<ctime>
#include<stack>
#include<bitset>
using namespace std;
#define mes(a,b) memset(a,b,sizeof(a))
#define rep(i,a,b) for(int i = a; i <= b; i++)
#define dec(i,a,b) for(int i = b; i >= a; i--)
#define fi first
#define se second
#define ls rt<<1
#define rs rt<<1|1
#define lson ls,L,mid
#define rson rs,mid+1,R
#define lowbit(x) x&(-x)
typedef double db;
typedef long long int ll;
typedef pair<int,int> pii;
typedef unsigned long long ull;
const ll inf = 0x3f3f3f3f;
const int mx = 2e5+5;
const int x_move[] = {1,-1,0,0,1,1,-1,-1};
const int y_move[] = {0,0,1,-1,1,-1,1,-1};
int n,m;
struct sam{
	int ch[mx][26];
	int f[mx];
	int len[mx];
	int rt,last,sz;
	int dp[mx];
	int newnode(int v){
		len[++sz] = v;
		mes(ch[sz],0);
		return sz;
	}
	void init(){
		mes(dp,-1);
		sz = 0;
		rt = last = newnode(0);
		f[rt]  = 0;
	}
	void insert(int c){
		int p = last,np = newnode(len[last]+1);
		while(p&&!ch[p][c]) ch[p][c] = np,p = f[p];
		if(!p)
			f[np] = rt;
		else{
			int q = ch[p][c];
			if(len[q] == len[p]+1) f[np] = q;
			else{
				int nq = newnode(len[p]+1);
				memcpy(ch[nq],ch[q],sizeof(ch[nq]));
				f[nq] = f[q];
				f[q] = f[np] = nq;
				while(p &&ch[p][c] == q)  ch[p][c] = nq,p = f[p];
			}
		}
		last  = np;
	}
	int dfs(int u){
		if(dp[u]!=-1)	return dp[u];
		bool vis[30];
		memset(vis,0,sizeof(vis));
		for(int i = 0; i < 26; i++)
			if(ch[u][i])
				vis[dfs(ch[u][i])] = 1;
		for(int i = 0; ; i++)
			if(!vis[i])
				return dp[u] = i;
	}
	int find(char s[]){
		int u = rt;
		for(int i = 1; s[i]; i++)
			u = ch[u][s[i]-'a'];
		return dfs(u);
	}	
}word;
char str[mx];
int main(){
	int t,q,ca = 1;
	while(scanf("%s",str+1)!=EOF){
		word.init();
		for(int i  = 1; str[i]; i++)
			word.insert(str[i]-'a');
		int sum = 0;
		scanf("%d",&q);
		while(q--){
			scanf("%s",str+1);
			sum ^= word.find(str);
		}
		//cout<<sum<<endl;
		if(sum)
			puts("Alice");
		else
			puts("Bob");
	}
	return 0;
}