1145. Hashing - Average Search Time (25)-PAT甲级真题(平方探测法 哈希表)

题意

给定一个窗口win，向上调整到最近素数。给定插入数n，查询数m，然后尝试依次插入n个数字，查询m个数字。输出插入失败的数字，平均查询长度。
Quadratic probing : 平方探测法，每次$ke{y}_i=key+i\ast i$ 而不是$ke{y}_i=ke{y}_{i-1}+i\ast i$(key = data[i] % win)

总结

• pow函数返回值类型是double，不可以放在下标中如：rec[(it + pow(cnt, 2)) % win]
• 失败查找也算一次，所以找了所有win个位置后，会再找$ke{y}_{win}$才出循环，也就是sum += cnt + 1;

题解

#include<bits/stdc++.h>
using namespace std;
int win, n, m, it, rec[10020], cnt;
bool isprime(int x){
	if(x < 2)return false;
	for(int i = 2; i <= x / i; i ++)
		if(x % i == 0) return false;
	return true;
}
int main(){
	cin>>win>>n>>m;
	while(!isprime(win)) win++;
	while(n --){
		scanf("%d", &it);
		cnt = 0;
		while(rec[(it + cnt * cnt) % win] != 0 && cnt < win) cnt ++;
		if(cnt == win) printf("%d cannot be inserted.\n", it);
		else rec[(it + cnt * cnt) % win] = it; 
	}
	double sum = 0;
	for(int i = 0; i < m; i++){
		scanf("%d", &it);
		cnt = 0;
		while(rec[(it + cnt * cnt) % win] != it && cnt != win && rec[(it + cnt * cnt) % win] != 0) cnt ++;
		sum += cnt + 1;
	}
	printf("%.1lf",sum / m);
	return 0;
}

题目

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