【YBTOJ进阶训练指导】上课点名【字符串Hash】

思路：

直接字符串hash

$code$

#pragma GCC optimize(3)//别在意
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#pragma GCC optimize(2)
#include<iostream>
#include<cstdio>

using namespace std;

int mod=133331;
int n;
struct node
{
	bool x;
	string ss;
}ha[133332];

inline int hash_(string s)
{
	register unsigned long long tmp=0;
	register int len=s.size();
	for(register int i=len-1; i>-1; --i)
		tmp=(tmp*131)^s[i];
	tmp%=mod;
	register int tmp1=tmp;
	while(ha[tmp].ss!=s&&ha[tmp].ss!="")
	{
		++tmp;
		if(tmp>=mod)
			tmp=0;
	}
	if(ha[tmp].ss!=s)
		return 0;
	else
	{
		register int flag;
		if(!ha[tmp].x)
		{
			ha[tmp].x=1;
			return 1;
		}
		else return 2;
		ha[tmp].x=1;
	}
}

int main()
{
	scanf("%d ", &n);
	for(register int i=1; i<=n; ++i)
	{
		register string s;
		getline(cin, s);
		register unsigned long long tmp=0;
		register int len=s.size();
		for(register int i=len-1; i>-1; --i)
			tmp=(tmp*131)^s[i];
		tmp%=mod;
		register int tmp1=tmp;
		while(ha[tmp].ss!="")
			++tmp;
		ha[tmp].ss=s;
	}
	register int q;
	scanf("%d ", &q);
	while(q--)
	{
		register string s;
		getline(cin, s);
		if(hash_(s)==1)
			printf("OK\n");
		else if(hash_(s)==2)
			printf("REPEAT\n");
		else printf("WRONG\n");
	}
	return 0;
}

（关于卡常卡了半小时这件事）