Hash表模板

namespace Hash
{
    const ll N=50000;
    const ll H=999979;
    struct adj
    {
    ll nxt,v,num,val;
    }e[N];
    ll  head[H],ecnt=0;
    void init()
    {
    ecnt=0;
    memset(head,0,sizeof(head));
    }
    void insert(ll x,ll val)
    {
    ll org=x;
    x%=H;
    for (int i=head[x];i;i=e[i].nxt)
    {
        if (e[i].num==org)
        {
        e[i].val=val;
        return ;
        }
    }
    e[++ecnt].num=org;
    e[ecnt].val=val;
    e[ecnt].nxt=head[x];
    head[x]=ecnt;
    }
    ll query(ll x)
    {
    ll org=x;
    x%=H;
    for (int i=head[x];i;i=e[i].nxt)
        if (e[i].num==org) return e[i].val;
    return -1;
    }
}