1145 Hashing - Average Search Time (25 分)(哈希散列,平方探测法)

本文探讨了如何使用哈希表存储唯一正整数,并通过二次探测解决冲突。输入包括用户定义的表大小、要插入的数字及查找的键。程序会调整表大小为最接近的素数,实现插入操作并计算平均搜索时间。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

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 10

4

. 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 10

5

.

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

#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string>
#include <cctype>
#include <string.h>
#include <cstdio>
#include <unordered_set>
using namespace std;
bool isPrime(int a){
    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) printf("%d cannot be inserted.\n",a);
    }
    double ans=0.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("%.1f",ans/m);
    return 0;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

小火汁猛猛

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值