1063. Set Similarity (25)

1063. Set Similarity (25)

#include <iostream>
#include <numeric>
#include <algorithm>
using namespace std;
class CA
{
public:
	enum{N=50,M=10000};
	int n,u[N][M],l[N];
	void run();
	void getSimilarity(int r1,int r2);
};
void CA::getSimilarity(int r1,int r2)
{
	int tu[2*M],su,si;
	su=set_union(u[r1],u[r1]+l[r1],u[r2],u[r2]+l[r2],tu)-tu;
	si=set_intersection(u[r1],u[r1]+l[r1],u[r2],u[r2]+l[r2],tu)-tu;
	printf("%2.1f%%\n",(double)(si)*100/(double)su);
}
void CA::run()
{
	scanf("%d",&n);
	int i,j,m;
	for(i=0;i<n;i++)
	{
		scanf("%d",&m);
		for(j=0;j<m;j++)
		{
			scanf("%d",&u[i][j]);
		}
		sort(u[i],u[i]+m);
		l[i]=unique(u[i],u[i]+m)-u[i];
	}
	int k,r1,r2;
	scanf("%d",&k);
	while(k-->0)
	{
		scanf("%d%d",&r1,&r2);
		getSimilarity(r1-1,r2-1);
	}
}

int main()
{
//	freopen("test.in","r",stdin);
	CA *a=new CA;
	a->run();
	return 0;
}