PTA Set Similarity (25分)

最新推荐文章于 2022-01-10 18:34:31 发布

0k-ok

最新推荐文章于 2022-01-10 18:34:31 发布

阅读量61

点赞数

分类专栏： PTA

本文链接：https://blog.csdn.net/weixin_44170305/article/details/108707894

版权

PTA 专栏收录该内容

269 篇文章 5 订阅

订阅专栏

我们活在这个世界上，没有一件事是虚空而生的，你站在光里背后就会有阴影，站在黑暗里心中也可能有光明，所以我们必须得承认，有一部分人或许丧失了初心，但也有一部分人用生命来践行诺言。

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 <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <vector>
#include <ctime>
#include <cctype>
#include <bitset>
#include <utility>
#include <sstream>
#include <complex>
#include <iomanip>
#include <numeric>
#include<unordered_set>
#include <climits>//INT_MAX
#define PP pair<ll,int>
#define inf 0x3f3f3f3f
#define llinf 0x3f3f3f3f3f3f3f3fll
#define dinf 1000000000000.0
#define PI 3.1415926
//#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N=1e5+10;
const int  maxn=100010;
int t,n,p,k;
vector<unordered_set<int> > jg;
int main()
{
    cin>>n;
    for(int i=0;i<n;i++)
    {
        cin>>t;
        unordered_set<int> a;
        for(int j=0;j<t;j++)
        {
            cin>>p;
            a.insert(p);
        }
        jg.push_back(a);
    }
    cin>>k;
    for(int i=0;i<k;i++)
    {
        int ct=0;
        int p,q;
        cin >> p>> q;
        for(auto it=jg[p-1].begin();it!=jg[p-1].end();it++)
        {
            if(jg[q-1].find((*it))!=jg[q-1].end())
                ct++;
        }
        printf("%.1f%%\n",(double)ct/(jg[p-1].size()+jg[q-1].size()-ct)*100.0);
    }
    return 0;
}