PAT真题练习(甲级)1145 Hashing - Average Search Time (25 分)
原题网址:https://pintia.cn/problem-sets/994805342720868352/problems/994805343236767744
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): H(key) = (key + i * i) % TSize (0 <= i < TSize)
几个注意点:
- 在查找的过程中,i = MSize的情况也会计数,即若该数不存在,则查找次数应为
TSize + 1
。 - 在查找的过程中,当
算得键值无对应数
或应当跳出查找循环(意味着该数不可能存在)。
AC代码
#include <stdio.h>
#include <iostream>
#include <vector>
#include<math.h>
using namespace std;
bool isPrime(int n) {
if (n == 1) return false;
for (auto i = 2;i <= sqrt(n) + 1;i++) {
if (n % i == 0) return false;
}
return true;
}
int main() {
int MSize, N, M;
cin >> MSize >> N >> M;
while (!isPrime(MSize)) {
MSize++;
}
vector<int> hash(MSize,-1);
for (auto i = 0;i < N;i++) {
int tmp;
cin >> tmp;
int j;
for(j = 0; j < MSize;j++){
int key = (tmp + j * j) % MSize;
if(hash[key] == -1){
hash[key] = tmp;
break;
}
}
if(j == MSize) cout<< tmp << " cannot be inserted." << endl;
}
int count = 0;
for (auto i = 0;i < M;i++) {
int tmp;
cin >> tmp;
for(auto j = 0 ; j <= MSize;j++){
count ++;
int key = (tmp + j * j) % MSize;
if(hash[key] == tmp || hash[key] == -1) break;
}
}
printf("%.1f", 1.0 * count / M);
}