1063 Set Similarity (25 分)

1063 Set Similarity (25 分)

#include <iostream>
#include <algorithm> 
#include <set>
#include <unordered_set>
using namespace std;
unordered_set<int> s[51]; 
int main(){
	int n, m, k, x, y;
	scanf("%d", &n);
	for(int i = 1; i <= n; ++i) {
		scanf("%d", &m);
		while(m--) {
			scanf("%d", &x);
			s[i].insert(x);
		}
	} 
	scanf("%d", &k);
	while(k--) {
		scanf("%d%d", &x, &y);
		int s1 = 0, s2 = s[y].size();
		for(unordered_set<int>::iterator it = s[x].begin(); it != s[x].end(); it++){
			if(s[y].find(*it) != s[y].end())
				s1++;
			else
				s2++;
		}
		printf("%.1lf%\n", 100.0 * s1 / s2);
	}
}