洛谷 #2580. 于是他错误的点名开始了

题意

判断点名错误、合法、重复

题解

字典树

调试记录

无

#include <cstdio>
#include <cstring> 
#define maxn 1000005

using namespace std;

struct node{
	bool vis, exist;
	int next[26], cnt;
}tree[maxn];

int n, m, tot = 0;
char s[maxn];

void insert(){
	int l = strlen(s + 1);
	int last = 1;
	
	for (int i = 1; i <= l; i++){
		if (tree[last].next[s[i] - 'a'] == 0){
			tot++;
			tree[tot].cnt = tot;
			tree[last].next[s[i] - 'a'] = tot;
			last = tot;
		}
		else last = tree[last].next[s[i] - 'a'];
		if (i == l) tree[last].exist = true;
	}
}

int search(){
	int l = strlen(s + 1);
	int last = 1;
	
	for (int i = 1; i <= l; i++){
		if (tree[last].next[s[i] - 'a'] == 0) return 0;
		last = tree[last].next[s[i] - 'a'];
	}
	if (!tree[last].exist) return 0;
	if (tree[last].vis) return 2;
	tree[last].vis = true;
	return 1;
}

int main(){
	scanf("%d", &n);
	for (int i = 1; i <= n; i++){
		scanf("%s", s + 1);
		insert();
	}
	scanf("%d", &m);
	for (int i = 1; i <= m; i++){
		scanf("%s", s + 1);
		int res = search();
		if (res == 0) printf("WRONG\n");
		if (res == 1) printf("OK\n");
		if (res == 2) printf("REPEAT\n");
	}
	
	return 0;
}