【PAT刷题甲级】1063.Set Similarity

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 (≤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%

题意
计算两个集合的相似度，即共同元素数/两个集合合并后元素总数的百分比。(使用map<int,set>)

代码

#include <iostream>
#include <set>
#include <map>
using namespace std;
map<int,set<int>> a;
int main() {
	int n,m,t,k,s1,s2;	//集合总数，每个集合元素个数,元素t,需要计算集合相似度的集合对数k,集合1，集合2
	scanf("%d",&n);
	for(int i=1; i<=n; i++) {
		scanf("%d",&m);
		for(int j=0; j<m; j++) {
			scanf("%d",&t);
			a[i].insert(t);
		}
	}
	scanf("%d",&k);
	for(int i=0; i<k; i++) {
		int nc=0,nt;
		scanf("%d %d",&s1,&s2);
		for(auto it=a[s1].begin(); it!=a[s1].end(); it++) {
			if(a[s2].find(*it)!=a[s2].end())
				nc++;
		}
		nt = a[s1].size() + a[s2].size() - nc;
		float sim = (float)nc / (float)nt * 100;
		printf("%.1f\%\n",sim);
	}
	return 0;
}