计蒜客 A String Game (后缀自动机 + sg)

题目：https://nanti.jisuanke.com/t/24852

题意：给一个字符串 T， 和n个T的字串。两个人轮流操作，每次可以从n个字符串中选择一个串s[i]，然后在s[i]的最后添上一个字符，满足得到的新串仍然是t的子串。不能操作者输。

题解：后缀自动机 + sg.( 知道后缀自动机后确实感觉很裸的一道题)；

，，，，，，，，，，，，，，，，，，，，，，，，，，

#include<stdio.h>
#include<string.h>
#include<vector>
using namespace std;
const int CHAR = 26;
const int MAXN = 250010;
struct SAM_Node
{
    SAM_Node *fa,*next[CHAR];
    int len;
    int id,pos;
    SAM_Node() {}     SAM_Node(int _len)
    {
        fa = 0;
        len = _len;
        memset(next,0,sizeof(next));
    }
};
SAM_Node SAM_node[MAXN*2], *SAM_root, *SAM_last;
int SAM_size;
SAM_Node *newSAM_Node(int len)
{
    SAM_node[SAM_size] = SAM_Node(len);
    SAM_node[SAM_size].id = SAM_size;
    return &SAM_node[SAM_size++];
}
SAM_Node *newSAM_Node(SAM_Node *p)
{
    SAM_node[SAM_size] = *p;
    SAM_node[SAM_size].id = SAM_size;
    return &SAM_node[SAM_size++];
}
void SAM_init()
{
    SAM_size = 0;
    SAM_root = SAM_last = newSAM_Node(0);
    SAM_node[0].pos = 0;
}
void SAM_add(int x,int len)
{
    SAM_Node *p = SAM_last, *np = newSAM_Node(p->len+1);
    np->pos = len;
    SAM_last = np;
    for(; p && !p->next[x]; p = p->fa)         p->next[x] = np;
    if(!p)
    {
        np->fa = SAM_root;
        return;
    }
    SAM_Node *q = p->next[x];
    if(q->len == p->len + 1)
    {
        np->fa = q;
        return;
    }
    SAM_Node *nq = newSAM_Node(q);
    nq->len = p->len + 1;
    q->fa = nq;
    np->fa = nq;
    for(; p && p->next[x] == q; p = p->fa)  p->next[x] = nq;
}
void SAM_build(char *s)
{
    SAM_init();
    int len = strlen(s);
    for(int i = 0; i < len; i++)   SAM_add(s[i] - 'a',i+1);
}
//加入串后进行拓扑排序。
char str[MAXN];
int topocnt[MAXN],d[MAXN];
int n,Xor;
void dfs(SAM_Node* x)
{
    if(d[x->id]!=-1) return;
    int vis[50];
    memset(vis,0,sizeof(vis));
    for(int i=0; i<CHAR; i++)
    {
        if(x->next[i]) dfs(x->next[i]), vis[d[x->next[i]->id]] = 1;
    }
    for(int i=0; i<27; i++)
    {
        if(vis[i]==0)
        {
            d[x->id] = i;
            break;
        }
    }
}
int main()
{
    while(~scanf("%s",str))
    {
        SAM_build(str);
        scanf("%d",&n);
        memset(d,-1,sizeof(d));
        dfs(SAM_root);
        Xor = 0;
        SAM_Node *x;
        while(n--)
        {
            scanf("%s",str);
            x = SAM_root;
            for(int j=0; str[j]; j++) x = x->next[str[j]-'a'];
            Xor ^= d[x->id];
        }
        if(Xor==0) printf("Bob\n");
        else printf("Alice\n");
    }
    return 0;
}