PAT甲级 1063 Set Similarity(25) (STL)

最新推荐文章于 2024-07-22 23:59:01 发布

NHS6671

最新推荐文章于 2024-07-22 23:59:01 发布

阅读量128

点赞数

分类专栏： PAT-甲级文章标签：集合相似度算法 C++ 整数集合查询处理

本文链接：https://blog.csdn.net/NHS6671/article/details/125122868

版权

PAT-甲级专栏收录该内容

70 篇文章 0 订阅

订阅专栏

题目

Given two sets of integers, the similarity of the sets is defined to be $N_{c}$ / $N_{t}$ ×100%, where Nc is the number of distinct common numbers shared by the two sets, and Nt is the total number of distinct numbers in the two sets. Your job is to calculate the similarity of any given pair of sets.

输入

Each input file contains one test case. Each case first gives a positive integer N (≤50) which is the total number of sets. Then N lines follow, each gives a set with a positive M (≤ $10^{4}$ ) and followed by M integers in the range [0, $10^{9}$ ]. After the input of sets, a positive integer K (≤2000) is given, followed by K lines of queries. Each query gives a pair of set numbers (the sets are numbered from 1 to N). All the numbers in a line are separated by a space.

输出

For each query, print in one line the similarity of the sets, in the percentage form accurate up to 1 decimal place.

样例输入

3
3 99 87 101
4 87 101 5 87
7 99 101 18 5 135 18 99
2
1 2
1 3

样例输出

50.0%
33.3%

题意理解

先输出n表示有n个集合每个集合中的元素要去重

我们可以用set解决这个问题

然后有m个查询输入集合 a和b 的编号

在集合中两个集合都有的公共元素个数是两个集合元素的剩余总元素和的多少百分比

那么我们直接暴力查询就好了

代码

#include<bits/stdc++.h>
using namespace std;
const int N=55;
set<int>st[N];
int n,m;
int main(){
    cin>>n;
    for(int i=1,k;i<=n;i++){
        scanf("%d",&k);
        for(int j=1,x;j<=k;j++){
            scanf("%d",&x);
            st[i].insert(x);
        }
    }
    cin>>m;
    for(int i=1,a,b;i<=m;i++){
        int cnt=0;
        scanf("%d%d",&a,&b);
        for(auto e:st[a]){
            if(st[b].count(e))cnt++;
        }
        printf("%0.1lf%%\n",cnt*1.0/(st[a].size()+st[b].size()-cnt)*100.0);
    }
    return 0;
}