8 哈希表专题

都挺简单的。。。

1、两数之和✔

1048 Find Coins

#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
const int N = 100000+10 ,M=1000+10;
int n,m;
int cnt[M];
int coins[N];
int main(){
    cin>>n>>m;
    for(int i=0;i<n;i++){
        cin>>coins[i];
        cnt[coins[i]]++;
    }
    for(int i=1;i<m;i++){
        if(cnt[i]>0 && cnt[m-i]>0) {
            if(i*2!=m) {
                cout<<i<<" "<<m-i<<endl;
                return 0;
            }
            else if(cnt[i]==2) {
                cout<<i<<" "<<i<<endl;
                return 0;
            }
        }
    }

    cout<<"No Solution"<<endl;
}

2、集合相似度✔

1063 Set Similarity

#include<iostream>
#include<vector>
#include<unordered_set>
#include<unordered_map>
using namespace std;
const int N=60,M = 10000+10;
int n,m;

//vector<int> sets[N];
unordered_map<int,int> map[N];

void query(int a,int b){
    double nc=0,nt=map[a].size()+map[b].size();

    for(auto &v:map[a]){
        if(map[b].count(v.first)>0) nc+=1;
    }
    nt-=nc;
    double ans=nc/nt*100;
    printf("%.1lf",ans);
    cout<<"%"<<endl;
    
}

int main(){
    cin>>n;
    for(int i=0;i<n;i++){
        int m;cin>>m;
        while(m--) {
            int a;cin>>a;
            //sets[i].push_back(a);
            map[i][a]++;
        }
    }
    int q;cin>>q;
    while(q--){
        int a,b;cin>>a>>b;
        query(a-1,b-1);
    }
}

3、数位之和✔

while(x)
1120 Friend Numbers

#include<iostream>
#include<unordered_map>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
using namespace std;
const int N = 10000+10;
unordered_map<int ,int > m;
int n;


int main(){
    cin>>n;
    for(int i=0;i<n;i++){
        int a;cin>>a;
        int ans=0;
        while(a){
            ans+= (a% 10);
            a /=10;
        }
        m[ans]++;
    }
    vector<int> ans;
    for(auto &v:m){
        ans.push_back(v.first);
    }
    cout<<ans.size()<<endl;
    sort(ans.begin(),ans.end());
    cout<<ans[0];
    for(int i=1;i<ans.size();i++){
        cout<<" "<<ans[i];
    }
    
}

4、最小正数✔

1144 The Missing Number

#include<iostream>
#include<cstring>
using namespace std;
const int N = 100000+10;
int a[N];
int main(){
    int n;cin>>n;
    for(int i=0;i<n;i++){
        int x;cin>>x;
        if(x>0 && x<N) a[x]=1;
    }
    for(int i=1;i<N;i++){
        if(a[i]==0) {
            cout<<i<<endl;
            break;
        }
    }
}

5、危险物品不能放一起✔

这题还不错
1149 Dangerous Goods Packaging

#include<iostream>
#include<unordered_set>
using namespace std;
const int N = 10000+10;
int n,m;
typedef pair<int,int> PII;
PII goods[N];

void query(){
    int k;cin>>k;
    unordered_set<int> set;
    while(k--) {
        int a;cin>>a;
        set.insert(a);
    }
    for(int i=0;i<n;i++){
        if(set.count(goods[i].first) && set.count(goods[i].second) ){
            cout<<"No"<<endl;
            return ;
        }
    }
    cout<<"Yes"<<endl;
}



int main (){
    cin>>n>>m;
    for(int i=0;i<n;i++){
        int a,b;
        cin>>a>>b;
        goods[i].first=a;
        goods[i].second=b;
    }



    while(m--){
        query();
    }
}

6、手写哈希表😒

开放定址法，平方探测。
1078 Hashing

7、慕课合格证书发放✔

round对double进行近似处理
1137 Final Grading

#include<iostream>
#include<cstring>
#include<unordered_map>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
const int N = 10000+10;
int n,m,l;
struct People{
    string name;
    int program;
    int mid=-1;
    int finnal=-1;
    int g;
    bool operator < (People x){
        if(g!=x.g) return g>x.g;
        else return name<x.name;
    }
};

unordered_map<string,People> peoples;

int main(){
    cin>>n>>m>>l;
    while(n--){
        string name;
        int score;
        cin>>name>>score;
        if(score>=200) peoples[name].program = score,peoples[name].name = name;
    }
    while(m--){
        string name;
        int score;
        cin>>name>>score;
        peoples[name].mid = score;
        peoples[name].name = name;
    }
    while(l--){
        string name;
        int score;
        cin>>name>>score;
        peoples[name].finnal = score;
        peoples[name].name = name;
    }

    vector<People> ans;
    for(auto &people:peoples){
        double mid=people.second.mid;
        double finnal=people.second.finnal;
        double g=finnal;
        if(mid>finnal) g=round(0.4*mid + 0.6*finnal);
        if(g>=60 && people.second.program>=200) {
            people.second.g=g;
            ans.push_back(people.second);
        }
    }
    sort(ans.begin(),ans.end());
    for(auto &v:ans){
        cout<<v.name<<" "<<v.program<<" "<<v.mid<<" "<<v.finnal<<" "<<v.g<<endl;
    }
    
}

8、平均查找时间😒

1145 Hashing - Average Search Time