题目链接:点击进入
题目
思路
对于每个节点,记录以这个节点为终点的字符串的编号,查询的时候,若有返回编号,若无返回 0 ,对于重复的情况,可以用 vis 数组标记一下。
代码
// Problem: P2580 于是他错误的点名开始了
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P2580
// Memory Limit: 125 MB
// Time Limit: 1000 ms
//
// Powered by CP Editor (https://cpeditor.org)
//#pragma GCC optimize(3)//O3
//#pragma GCC optimize(2)//O2
#include<iostream>
#include<string>
#include<map>
#include<set>
//#include<unordered_map>
#include<queue>
#include<cstdio>
#include<vector>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<fstream>
#define X first
#define Y second
#define best 131
#define INF 0x3f3f3f3f3f3f3f3f
#define pii pair<int,int>
#define lowbit(x) x & -x
#define inf 0x3f3f3f3f
//#define int long long
//#define double long double
//#define rep(i,x,y) for(register int i = x; i <= y;++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double pai=acos(-1.0);
const int maxn=1e6+10;
const int mod=998244353;
const double eps=1e-9;
const int N=5e3+10;
/*--------------------------------------------*/
inline int read()
{
int k = 0, f = 1 ;
char c = getchar() ;
while(!isdigit(c)){if(c == '-') f = -1 ;c = getchar() ;}
while(isdigit(c)) k = (k << 1) + (k << 3) + c - 48 ,c = getchar() ;
return k * f ;
}
/*--------------------------------------------*/
int n,m,tot;
string s;
bool vis[maxn];
struct node
{
int id;
int next[26];
}t[maxn];
void insert(string str,int id)
{
int len=s.size(),p=0;
for(int i=0;i<len;i++)
{
int to=str[i]-'a';
if(t[p].next[to]==0)
{
t[p].next[to]=++tot;
p=t[p].next[to];
t[p].id=0;
}
else
p=t[p].next[to];
}
t[p].id=id;
}
int find(string str)
{
int len=str.size(),p=0;
for(int i=0;i<len;i++)
{
int to=str[i]-'a';
if(t[p].next[to]==0)
return 0;
else
p=t[p].next[to];
}
return t[p].id;
}
int main()
{
// ios::sync_with_stdio(false);
// cin.tie(0);cout.tie(0);
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>s;
insert(s,i);
}
cin>>m;
while(m--)
{
cin>>s;
int flag=find(s);
if(flag==0)
cout<<"WRONG"<<endl;
else if(vis[flag])
cout<<"REPEAT"<<endl;
else
cout<<"OK"<<endl;
vis[flag]=1;
}
return 0;
}