PTA甲级考试真题练习63——1063 Set Similarity

题目

思路

使用set自带的查找即可

代码

#include <iostream>
#include<algorithm>
#include<set>

using namespace std;
#define nmax 100001
#define inf 999999

vector<set<int>> vec;

int main()
{
	int n;
	cin >> n;
	for (int i = 0; i < n; ++i) {
		set<int> s;
		int sn;
		cin >> sn;
		for (int j = 0; j < sn; ++j) {
			int tmp;
			cin >> tmp;
			s.insert(tmp);
		}
		vec.emplace_back(s);
	}
	int qn;
	cin >> qn;
	for (int i = 0; i < qn; ++i) {
		int id1, id2;
		cin >> id1 >> id2;
		int nc = 0, nt;
		for (auto& p : vec[id2 - 1]) {
			auto iter = vec[id1 - 1].find(p);
			if (iter != vec[id1 - 1].end())
				nc++;
		}
		nt = vec[id1-1].size()+vec[id2-1].size()-nc;
		double ans = (double)nc / nt * 100;
		printf("%.1lf", ans);
		cout << "%" << endl;
	}
	return 0;
}