哈希表模板

#pragma GCC optimize("O2")
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<limits.h>
#include<ctime>
#define N 1000010
typedef long long ll;
const int inf=0x3fffffff;
const int maxn=2017;
using namespace std;
inline ll read()
{
    ll f=1,x=0;char ch=getchar();
    while(ch>‘9‘|ch<‘0‘)
    {
        if(ch==‘-‘)
        f=-1;
        ch=getchar();
    }
    while(ch<=‘9‘&&ch>=‘0‘)
    {
        x=(x<<3)+(x<<1)+ch-‘0‘;
        ch=getchar();
    }
    return f*x;
}
ll hashmap[N];
bool mark[N];

inline int hash(ll x)
{
	int a=x%N;
	while(mark[a]==1&&hashmap[a]!=x)
	a=(a+1)%N;
	mark[a]=1;
	return a;
}

int main()
{
	int n=read(),m=read();
	for(int i=1;i<=n;i++) 
	{
		ll a=read();
		hashmap[hash(a)]=a;
	}
	for(int i=1;i<=m;i++)
	{
		ll a=read();
		printf(hashmap[hash(a)]==a?"Yes\n":"No\n");
	}
}