1063 Set Similarity (25 分)

1063 Set Similarity (25 分)

Given two sets of integers, the similarity of the sets is defined to be N​c​​ /N​t​​ ×100%, where N​c​​ is the number of distinct common numbers shared by the two sets, and N​t​​ 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​⁴​​ ) and followed by M integers in the range [0,10​⁹​​ ]. 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<bits/stdc++.h>
using namespace std;
int N, M, K, a, b, temp;
unordered_set<int> s[55];
int main() {
	scanf("%d", &N);
	for (int i = 1; i <= N; i++) {
		scanf("%d", &M);
		for (int j = 0; j < M; j++) {
			scanf("%d", &temp);
			s[i].insert(temp); 
		}
	}
	scanf("%d", &K);
	for (int i = 0; i < K; i++) {
		scanf("%d %d", &a, &b);
		int cout = s[a].size() + s[b].size(), cnt = 0;
		for (auto it = s[a].begin(); it != s[a].end(); it++) {
			if (s[b].find(*it) != s[b].end()) {
				cnt++;
				cout--;
			}
		}
		double sum = cnt * 1.0 / cout * 1.0 * 100;
		printf("%.1f%%\n", sum);
	}
}