是男人就过 8 题--Pony.AI 题(A String Game-SAM建图+sg)

给一个字符串t和t的n个子串，2人轮流操作，
每次选一个子串，在后面添加一个字符，放回去，要求添加后字符串仍是t的子串。
无法操作者输，问谁赢。

SAM建图+sg

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
#include<iomanip> 
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<sstream>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (x<<1)
#define Rson ((x<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define MAXN (100000*2+10)
#define Sigmasize (26) 
typedef unsigned long long ll;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return (a-b+llabs(a-b)/F*F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
class SAM {
public:
    char s[MAXN];
    int n;
    SAM():n(0){MEM(s) MEM(son) MEM(pre) MEM(step) last=tot=0;}
    SAM(char *_s){n=strlen(_s),memcpy(s,_s,sizeof(char)*(n+5)); MEM(son) MEM(pre) MEM(step) last=tot=0;}
    void mem(){n=0; MEM(s) MEM(son) MEM(pre) MEM(step) last=tot=0;}
    void mem(char *_s){n=strlen(_s);memcpy(s,_s,sizeof(char)*(n+5)); MEM(son) MEM(pre) MEM(step) last=tot=0; MEMI(l) MEMi(r) MEM(c) MEM(q)}

    int son[MAXN][Sigmasize+1],pre[MAXN],step[MAXN],last,tot;
    int l[MAXN],r[MAXN];
    void extend(char ch)
    {
        step[++tot]=step[last]+1;
        int p=last,np=tot;
        l[tot]=r[tot]=step[tot];

        for(;!son[p][ch];p=pre[p]) son[p][ch]=np;
        if (!p) pre[np]=1;
        else {
            int q=son[p][ch];
            if (step[q]==step[p]+1) pre[np]=q;
            else {
                step[++tot]=step[p]+1;
                int nq=tot;
                memcpy(son[nq],son[q],sizeof(son[q]));
                pre[nq]=pre[q];
                pre[q]=pre[np]=nq;
                for(;son[p][ch]==q;p=pre[p]) son[p][ch]=nq;
            }
        }
        last=np;
    }

    void build(){
        last=tot=1;
        Rep(i,n) extend(s[i]-'a');
    }
    int c[MAXN],q[MAXN],len[MAXN];
    int val[MAXN];
    void calc() {
        MEM(c)
        For(i,tot) c[step[i]]++;
        For(i,tot) c[i]+=c[i-1];
        For(i,tot) q[c[step[i]]--]=i;

        ForD(i,tot) {
            int u=q[i];
            bool bo[27]={};
            Rep(ch,26) if (son[u][ch]>0) {
                int t=val[son[u][ch]];
                if(t<=26) bo[t]=1;
            }
            int x=0;
            while(bo[x]) ++x;
            val[u]=x;
        }   

    }
}S1; 
char s[MAXN],s2[MAXN];
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
int main()
{
//  freopen("a.in","r",stdin);
    while(scanf("%s",s)==1) {
        int n=strlen(s);
        S1.mem(s);
        S1.build();
        S1.calc();
        int p=0;
        int nn=read();
        For(i,nn) {
            scanf("%s",s2);
            int l=strlen(s2);
            int x=1;
            Rep(i,l) x=S1.son[x][s2[i]-'a'];
            p^=S1.val[x];
        }
        puts(p?"Alice":"Bob");
    }
    return 0;
}