【PAT甲级】1145 Hashing - Average Search Time（25 分）（平方探测法）

最新推荐文章于 2020-06-14 08:11:47 发布

feng_zhiyu

最新推荐文章于 2020-06-14 08:11:47 发布

阅读量448

点赞数

分类专栏： ACM_哈希 PAT 文章标签：平方探测法

本文链接：https://blog.csdn.net/feng_zhiyu/article/details/82077975

版权

PAT 同时被 2 个专栏收录

130 篇文章 0 订阅

订阅专栏

ACM_哈希

4 篇文章 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

题意：给定Msie,n,m分别为Hash表的大小，插入的数的个数，查找的数的个数。（Msize是大于自身的最小素数）如果找到查询的数，输出平均查找次数，否则输出”X cannot be inserted“

相似题目：【PAT甲级】1078 Hashing（25 分）（平方探测法）

思路：处理冲突：平方探测法　pos=(x+j*j)%Msize,ｊ取值-1,0,1,2,3,4.此题只考虑正增长（

Quadratic probing (with positive increments only) is used to solve the collisions.

）

代码：

#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <cstdio>
#include <string>
#include <vector>
#include <climits>
#include <sstream>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define mem(a,n) memset(a,n,sizeof(a))
#define lowbit(i) ((i)&(-i))
typedef long long ll;
typedef unsigned long long ull;
const ll INF=0x3f3f3f3f;
const double eps = 1e-6;
const int N = 1e3+5;

bool isPrime(int x) {
    if(x<=1) return false;
    for(int i=2; i*i<=x; i++) {
        if(x%i==0) return false;
    }
    return true;
}
int quadraticProb(int x,int j,int Msize) {
    return (x+j*j)%Msize;
}
int main() {
    int Msize,n,m;
    scanf("%d%d%d",&Msize,&n,&m);
    while(!isPrime(Msize)) {
        Msize++;
    }
    vector<int>vec(Msize);
    int x;
    for(int i=0; i<n; i++) {
        scanf("%d",&x);
        bool flag=0;
        for(int j=0; j<Msize; j++) {
            int pos=quadraticProb(x,j,Msize);
            if(vec[pos]==0) {
                vec[pos]=x;
                flag=1;
                break;
            }
        }
        if(!flag) {
            printf("%d cannot be inserted.\n",x);
        }
    }
    double ans=0;
    for(int i=0; i<m; i++) {
        scanf("%d",&x);
        int cnt=0;
        bool flag=0;
        for(int j=0; j<Msize; j++) {
            cnt++;
            int pos=quadraticProb(x,j,Msize);
            if(vec[pos]==x||vec[pos]==0) {
                flag=1;
                break;
            }
        }
        if(!flag) {///在Hash Table中没找到　+1
            cnt++;
        }
        ans+=cnt;
    }
    printf("%.1lf\n",ans/m);
    return 0;
}