1145. Hashing - Average Search Time (25)

The task of this problem is simple: insert a sequence of distinct positive integers into a hash table first. Then try to find another sequence of integer keys from the table and output the average search time (the number of comparisons made to find whether or not the key is in the table). The hash function is defined to be "H(key) = key % TSize" where TSize is the maximum size of the hash table. Quadratic probing (with positive increments only) is used to solve the collisions.

Note that the table size is better to be prime. If the maximum size given by the user is not prime, you must re-define the table size to be the smallest prime number which is larger than the size given by the user.

Input Specification:

Each input file contains one test case. For each case, the first line contains two positive numbers: MSize, N, and M, which are the user-defined table size, the number of input numbers, and the number of keys to be found, respectively. All the three numbers are no more than 10⁴. Then N distinct positive integers are given in the next line. All the numbers in a line are separated by a space and are no more than 10⁵.

Output Specification:

For each test case, in case it is impossible to insert some number, print in a line "X cannot be inserted." where X is the input number. Finally print in a line the average search time for all the M keys, accurate up to 1 decimal place.

Sample Input:

4 5 4
10 6 4 15 11
11 4 15 2

Sample Output:

15 cannot be inserted.
2.8

平方探测法先把数据插入，能插入的计算一下找位置花的时间存入p。
计算查找的花费时，如果p不为0，直接加，如果为0，表示表里没有（要么没插入，要么插不进去，没插入的直到找到vis标记为0就返回步数，否则返回msize + 1（循环停止的条件））。
代码：

#include <iostream>
#include <cstring>
#include <cstdio>
#include <map>
#define Max 100005
using namespace std;
int msize,n,m,d;
double c = ;
int s[],vis[],p[];
bool ispri(int t)
{
    if(t <= )return ;
    if(t ==  || t == )return true;
    if(t %  !=  && t %  != )return false;
    for(int i = ;i * i <= t;i += )
    {
        if(t % i ==  || t % (i + ) == )return false;
    }
    return true;
}
int nexpri(int t)
{
    while(!ispri(t))t ++;
    return t;
}
int insert_(int t)
{
    int e = t % msize;
    for(int i = ;i < msize;i ++)
    {
        int ee = (e + i * i) % msize;
        if(!vis[ee])
        {
            s[ee] = t;
            vis[ee] = ;
            p[t] = i + ;
            return ;
        }
    }
    return ;
}
int search_(int t)
{
    int e = t % msize;
    for(int i = ;i < msize;i ++)
    {
        int ee = (e + i * i) % msize;
        if(!vis[ee] || s[ee] == t)
        {
            return i + ;
        }
    }
    return msize + ;
}
int main()
{
    scanf("%d%d%d",&msize,&n,&m);
    msize = nexpri(msize);
    for(int i = ;i < n;i ++)
    {
        scanf("%d",&d);
        if(!insert_(d))printf("%d cannot be inserted.\n",d);
    }
    for(int i = ;i < m;i ++)
    {
        scanf("%d",&d);
        c += p[d] ? p[d] : search_(d);
    }
    printf("%.1f",c / m);
}