PAT A1063 Set Similarity

最新推荐文章于 2024-08-18 21:07:18 发布

疯疯癫癫才自由

最新推荐文章于 2024-08-18 21:07:18 发布

阅读量45

点赞数

分类专栏： # PAT甲级题解文章标签： c++ PAT甲级

本文链接：https://blog.csdn.net/qq_51825761/article/details/130787435

版权

PAT甲级题解专栏收录该内容

65 篇文章 0 订阅

订阅专栏

1063 Set Similarity

分数 25

作者 CHEN, Yue

单位浙江大学

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%

每一个集合用一个set来存储，set会自动根据值进行递增排序，时间复杂度O(N * lgN);
* 一共 50 * 1e4 = 5e5 个数据，O(N * lgN)的时间复杂度可以AC；这样后面进行比较两个集合中
* 的相同值的个数的时候可以在O(n)的时间复杂度完成；
*
* 故时间复杂度主要兄啊消耗在set排序中；

/**
 * 每一个集合用一个set来存储，set会自动根据值进行递增排序，时间复杂度O(N * lgN);
 * 一共 50 * 1e4 = 5e5 个数据，O(N * lgN)的时间复杂度可以AC；这样后面进行比较两个集合中
 * 的相同值的个数的时候可以在O(n)的时间复杂度完成；
 * 
 * 故时间复杂度主要兄啊消耗在set排序中；
*/


#include <iostream>
#include <cstring>
#include <algorithm>
#include <set>

using namespace std;

const int N = 1e4+10;
set<int> st[N];

int main()
{
    int n, m;
    cin >> n;
    for(int i=1; i<=n; ++i)
    {
        int k;
        cin >> k;
        while(k--)
        {
            int v;
            cin >> v;
            st[i].insert(v);
        }
    }
    
    cin >> m;
    while (m -- )
    {
        int l, r;
        cin >> l >> r;
        int com = 0, all = 0;
        
        auto it1 = st[l].begin(), it2 = st[r].begin();
        while(it1 != st[l].end() && it2 != st[r].end())
        {
            if(*it1 < *it2)
            {
                ++it1;
                ++all;
            }
            else if(*it1 > *it2)
            {
                ++it2;
                ++all;
            }
            else
            {
                ++com;
                ++all;
                ++it1, ++it2;
            }
        }
        
        while(it1 != st[l].end())
        {
            ++it1;
            ++all;
        }
        while(it2 != st[r].end())
        {
            ++it2;
            ++all;
        }
        
        printf("%.1f%%\n", com*100.0/all);
    }
    
    return 0;
}