L2-005 集合相似度

#include<bits/stdc++.h>
//#define int long long
#define PII pair<int,int>
using namespace std;
const int N=1e4+10;

int n;
int cnt[55];
vector<int> h[55];
bool st[55][N];

signed main(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		int m;
		cin>>m;
		cnt[i]=m;
		while(m--){
			int x;
			cin>>x;
			h[i].push_back(x);
		}
		sort(h[i].begin(),h[i].end());
		int last=-1;
		for(int j=0;j<h[i].size();j++){
			if(h[i][j]==last){
				st[i][j]=true;
				cnt[i]--;
			}
			last=h[i][j];
		}
	}
	int q;
	cin>>q;
	while(q--){
		int a,b;
		cin>>a>>b;
		int c=0;
		for(int i=0,j=0;i<h[a].size()&&j<h[b].size();i++){
			if(st[a][i]) continue;
			while(j<h[b].size()&&h[b][j]<h[a][i]) j++;
			if(h[b][j]==h[a][i]) c++;
		}
		int t=cnt[a]+cnt[b]-c;
		double ans=(double)c/t*100;
		printf("%.2lf%%\n",ans);
	}
	return 0; 
}