题目地址
#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
const int N=1e5+10;
const int mod=100003;
int h[N],e[N],ne[N],idx;
void insert(int x)
{
int u=(x%mod+mod)%mod;
e[idx]=x,ne[idx]=h[u],h[u]=idx++;
}
bool query(int x)
{
int u=(x%mod+mod)%mod;
for(int i=h[u];i!=-1;i=ne[i])
{
if(e[i]==x) return true;
}
return false;
}
int main(void)
{
int n; cin>>n;
memset(h,-1,sizeof h);
while(n--)
{
string s; int x;
cin>>s>>x;
if(s=="I")
{
insert(x);
}
else
{
if(query(x)) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
}
return 0;
}
#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
const int N=200003,null=0x3f3f3f3f;
int h[N];
int find(int x)
{
int k=(x%N+N)%N;
while(h[k]!=null&&h[k]!=x)
{
k++;
if(k==N) k=0;
}
return k;
}
int main(void)
{
int n; cin>>n;
memset(h,0x3f,sizeof h);
while(n--)
{
string op;
int x;
cin>>op>>x;
int k=find(x);
if(op=="I")
{
h[k]=x;
}
else
{
if(h[k]==null) cout<<"No"<<endl;
else cout<<"Yes"<<endl;
}
}
return 0;
}