PAT (Advanced) 1063. Set Similarity (25)

最后一个4分测试点老是超时，无奈网上搜解题报告。
注释里有我之前的方法，注意注释里的merge和现在的merge含义不一样。相应的最后输出公式也要修改。

利用set_intersection更潇洒飘逸~

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <iterator>
#include <functional>

using namespace std;

vector<set<int> > vec;

int main()
{
//	freopen("in.txt", "r", stdin);
	int n, m, k;
	scanf("%d", &n);
	vec.resize(n);
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &m);
		int tmp;
		for (int j = 0; j < m; j++)
		{
			scanf("%d", &tmp);
			vec[i].insert(tmp);
		}
	}

	scanf("%d", &k);
	int first, second;
	int len1, len2;
	set<int> merge;
	for (int i = 0; i < k; i++)
	{
		scanf("%d %d", &first, &second);
		len1 = vec[first - 1].size();
		len2 = vec[second - 1].size();

		set_intersection(vec[first - 1].begin(), vec[first - 1].end(), vec[second - 1].begin(), vec[second - 1].end(), inserter(merge, merge.begin()));
	/*	set<int> ::iterator it;
		set<int> merge(vec[first - 1].begin(), vec[first - 1].end());
		for (it = vec[second - 1].begin(); it != vec[second - 1].end(); ++it)
			merge.insert(*it);
			*/
		int merged_size = merge.size();
		merge.clear();
		printf("%.1f%%\n", merged_size * 100.0 / (len1 + len2 - merged_size));
	}
	return 0;
}