BZOJ2938【AC自动机】

来源：互联网发布：中国资讯型数据库作用编辑：程序博客网时间：2024/05/23 22:51
/* I will wait for you */#include<cstdio>#include<cstdlib>#include<cstring>#include<cmath>#include<ctime>#include<algorithm>#include<iostream>#include<fstream>#include<vector>#include<queue>#include<deque>#include<set>#include<map>#include<string>#define make make_pair#define fi first#define se secondusing namespace std;typedef long long LL;typedef unsigned long long ULL;typedef pair<int,int> PII;const int maxn=100010;const int maxm=1010;const int maxs=26;const int INF=1<<29;const int P=1000000007;const double error=1e-9;int cnt=0,next[maxn][2],fail[maxn],last[maxn],val[maxn],del[maxn],q[maxn],vis[maxn];int insert(char* s){int n=strlen(s),p=0;for(int i=0;i<n;i++){int c=s[i]-'0';if(!next[p][c]) next[p][c]=++cnt;p=next[p][c];}del[p]=val[p]=1;}int getfail(){int head=1,tail=0,c;for(int i=0;i<2;i++) if((c=next[0][i])) q[++tail]=c;while(head<=tail){int u=q[head++];for(int i=0;i<2;i++){if(!(c=next[u][i])) next[u][i]=next[fail[u]][i];else{fail[c]=next[fail[u]][i];last[c]=val[fail[c]]?fail[c]:last[fail[c]];q[++tail]=c;if(val[c]||last[c]) del[c]=1;}}}}int dfs(int u){vis[u]=-1;int c;for(int i=0;i<2;i++) if(!del[c=next[u][i]]&&vis[c]!=1)if(vis[c]==-1||dfs(c)) return 1;vis[u]=1;return 0;}int main(){int n;char s[maxn];scanf("%d",&n);for(int i=0;i<n;i++) scanf("%s",s),insert(s);getfail();printf("%s",dfs(0)?"TAK":"NIE");return 0;}
0 0