【哈希】模拟哈希（链式寻找法）

一、题目

活动 - AcWing

二、题解

#include<iostream>
using namespace std;
const int N = 1e5 + 10;
int m[N], e[N], ne[N], idx;

void init()
{
    idx = 0;
    for (int i = 0; i < N; i++) m[i] = -1;
}

void insert(int x)
{
    int index = (x % N + N) % N;
    e[idx] = x;
    ne[idx] = m[index];
    m[index] = idx;
    idx++;
}

void query(int x)
{
    int index = (x % N + N) % N;
    for (auto p = m[index]; p != -1; p = ne[p]) 
        if (e[p] == x) {
            cout << "Yes" << endl;
            return;
        }
    cout << "No" << endl;
}

int main()
{
    int n;
    cin >> n;
    init();
    while (n--)
    {
        char op;
        int x;
        cin >> op >> x;
        if (op == 'I') insert(x);
        else query(x);
    }
    return 0;
}