PAT甲级1063 Set Similarity (25 分)

1063 Set Similarity (25 分)

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 <map>
#include <vector>
using namespace std;

int main()
{
    vector<map<int,int> >vec;
    int total;
    cin>>total;
    for(int i=0;i<total;i++)
    {
        int m;
        scanf("%d",&m);
        map<int,int> mapp;
        for(int j=0;j<m;j++)
        {
            int num;
            scanf("%d",&num);
            mapp[num]++;
        }
        vec.push_back(mapp);
    }
    int question;
    cin>>question;
    for(int i=0;i<question;i++)
    {
        int a,b;
        scanf("%d%d",&a,&b);
        map<int,int> ::iterator it=vec[a-1].begin();
        int same=0,sum=0;
        while(it!=vec[a-1].end())
        {
            if(vec[b-1].count(it->first)>0)
                same++;
            it++;
        }
        sum=vec[a-1].size()+vec[b-1].size()-same;
        //cout<<same<<" "<<sum<<endl;
        printf("%.1f%\n",(same*1.0*100)/(sum*1.0));
    }
    return 0;
}