1063. Set Similarity

Set Similarity

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%

---

题意

给出一系列数字序列，计算指定两组序列的相似度，相似度计算公式为：
$$\frac{N_c}{N_t}\ast 100\%$$
其中$N_C$为交集不同数字个数，$N_t$为并集不同数字个数。

思路

先用set对每组序列进行去重和递增排序，再依次枚举序列a中元素，看能否在序列b中找到，以此计算出交集和并集中元素个数。

---

代码实现

#include <cstdio>
#include <set>
using namespace std;

const int maxn = 51;
set<int> sets[maxn];

int main()
{
	int n, m, x, k, a, b;
	int Nc, Nt;
	set<int>::iterator it;
	
	scanf("%d", &n);
	for (int i = 1; i <= n; i++)        //　序列去重排序后存储
	{
		scanf("%d", &m);
		for (int j = 0; j < m; j++)
		{
			scanf("%d", &x);
			sets[i].insert(x);
		}
	}
	
	scanf("%d", &k);
	for (int i = 0; i < k; i++)
	{
		Nc = 0;
		scanf("%d %d", &a, &b);
		for (it = sets[a].begin(); it != sets[a].end(); it++)   // 枚举a中元素，在b中查找
			if (sets[b].find(*it) != sets[b].end())
				Nc++;
		Nt = sets[a].size() + sets[b].size() - Nc;
		printf("%.1f%%\n", 1.0 * Nc / Nt * 100);
	}
	
	return 0;
}