AcWing 840. 模拟散列表
原题链接
简单
作者:
piaofan
,
2021-02-06 19:37:20
,
所有人可见
,
阅读 268
#include<bits/stdc++.h>
using namespace std;
const int N = 100003;
int h[N], e[N], ne[N], idx;
void insert (int x) {
int k = (x % N + N) % N;
e[idx] = x; ne[idx] = h[k]; h[k] = idx++;
}
bool find (int x) {
int k = (x % N + N) % N;
for (int i = h[k]; i != -1; i = ne[i]) {
if (e[i] == x) return true;
}
return false;
}
int main (void) {
int n, x;
char op;
cin >> n;
memset(h, -1, sizeof(h));
while (n--) {
cin >> op >> x;
if (op == 'I') {
insert(x);
} else {
if (find(x)) printf("Yes\n");
else printf("No\n");
}
}
return 0;
}