1063 Set Similarity (25分)

1063 Set Similarity (25分)

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

Input Specification:
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.

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

Sample Input:

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

Sample Output:

50.0%
33.3%

本题思路：用unordered_set存每一个集合，然后遍历集合寻找相同的个数，总个数即为两个集合的总个数-相同的个数

AC代码：

#include<iostream>
#include<unordered_set>
#include<vector>
#include<algorithm>
using namespace std;
int n;
vector<unordered_set<int>> ans;

int main()
{
    cin >> n;
    for(int i=0;i<n;i++)
    {
        int t;
        cin >> t;
        unordered_set<int> a;
        for(int j=0;j<t;j++)
        {
            int p;
            cin >> p;
            a.insert(p);
        }
        ans.push_back(a);
    }
    int k;
    cin >> k;
    for(int i=0;i<k;i++)
    {
        int cnt=0;
        int p,q;
        cin >> p>> q;
        for(auto it=ans[p-1].begin();it!=ans[p-1].end();it++)
        {
            if(ans[q-1].find((*it))!=ans[q-1].end())
                cnt++;
        }
        printf("%.1lf%%\n",(double)cnt/(ans[p-1].size()+ans[q-1].size()-cnt)*100.0);
    }
    return 0;
}