1063. Set Similarity (25)-PAT甲级真题

Given two sets of integers, the similarity of the sets is defined to be Nc​/Nt​×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.

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 (≤104) and followed by M integers in the range [0,109]. 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%

#include<set>
#include<vector>
#include<iostream>
using namespace std;
vector< set<int> > v(60);
int main(){
    int n;
    cin >> n;
    for(int i = 0; i < n; i++){
        int m;
        cin >> m;
        for(int j = 0; j < m; j++){
            int temp;
            cin >> temp;
            v[i].insert(temp);
        }
    }
    int k;
    cin >> k;
    for(int i = 0; i < k; i++){
        int a, b;
        cin >> a >> b;
        a -= 1;
        b -= 1;
        int len1 = v[a].size(), len2 = v[b].size();
        set<int> s;
        for(auto it = v[a].begin(); it != v[a].end(); it++) s.insert(*it);
        for(auto it = v[b].begin(); it != v[b].end(); it++) s.insert(*it);
        printf("%.1f%%\n",(len1 + len2 - s.size()) * 100.0 / s.size());
    }
    return 0;
}