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 3 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 104. Then N distinct positive integers are given in the next line, followed by M positive integer keys in the next line. All the numbers in a line are separated by a space and are no more than 105.
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
题意分析:
注意二次探测法的写法,不仅在插入时要使用,在后面搜索数字的时候也要用二次探测
Quadratic probing(二次探测法):
从发生冲突的单元加上1^2,2^2,3^2,...,n^2,直到遇到空闲的单元
其他解决冲突的办法看 哈希冲突解决 这个题解中的题意分析
代码如下:
2022.06.04:
#include<bits/stdc++.h>
using namespace std;
bool isprime(int a)
{
if(a<2)return false;
for(int i=2;i*i<=a;i++)
if(a%i==0)return false;
return true;
}
int main()
{
int msize,n,m,a;
cin>>msize>>n>>m;
while(!isprime(msize))msize++;
vector<int> v(msize);
for(int i=0;i<n;i++)
{
cin>>a;
int flag=0;
for(int j=0;j<msize;j++)
{
int pos=(a+j*j)%msize;
if(v[pos]==0){
v[pos]=a;
flag=1;
break;//插入成功
}
}
if(!flag)cout<<a<<" cannot be inserted.\n";
}
int ans=0;
for(int i=0;i<m;i++)
{
cin>>a;
for(int j=0;j<=msize;j++)
{
ans++;
int pos=(a+j*j)%msize;
if(v[pos]==a||v[pos]==0)break;
}
}
printf("%.1lf\n",ans*1.0/m);
return 0;
}
2022.08.09:
#include<bits/stdc++.h>
using namespace std;
//H(key)=key%TSize
//二次探测法处理冲突
bool isPrime(int a)
{
if (a == 1)return false;
for (int i = 2; i <= sqrt(a); i++) {
if (a % i == 0)return false;
}
return true;
}
int main()
{
//将哈希表的大小改为比原来大的最小素数
//MSize, N, and M
int msize, n, m, key;//n为输入的数字个数,m为待查找的数字
cin >> msize >> n >> m;
while (!isPrime(msize))msize++;
vector<int> hashtable(msize, 0);
int cnt = 0;//记录已经加入哈希表中的数字个数
//插入数字到哈希表中
for (int i = 0; i < n; i++) {
cin >> key;
bool isfind = false;
for (int step = 0; step < msize; step++) {
int index = (key + step * step) % msize;
if (hashtable[index] == 0) {
isfind = true;
hashtable[index] = key;
cnt++;
break;
}
}
if (!isfind)cout << key << " cannot be inserted." << endl;
if (cnt == msize)break;
}
//查找
int num;
float res = 0;//记录总比较次数
//注意查找方式,也是按照二次探测的方式
for (int i = 0; i < m; i++) {
cin >> num;
for (int step = 0; step <= msize; step++) {
res++;
int pos = (num + step * step) % msize;
if (hashtable[pos] == num || hashtable[pos] ==0) {
break;
}
}
}
cout << fixed << setprecision(1) << res / m << endl;
return 0;
}
运行结果如下:
2022.06.04:
2022.08.09: