这个题目之前看错题意了,好尴尬,后来一想其实也不难,只要先用set(map也可以)把集合元素去重,然后比较两个集合就可以了
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <queue>
#include <stack>
#include <set>
using namespace std;
const int INF = 0x3f3f3f3f;
int n,k,m,x,a[2010];
set<int>u[55];
void check(int first,int second){
int num = 0;
set<int>::iterator it;
for(it = u[first].begin();it != u[first].end(); it++)
if(u[second].find(*it) != u[second].end())
num++;
int sum = u[first].size()+u[second].size();
int nt = sum-num;
printf("%.2lf",num*1.0/nt*100);
cout<<"%"<<endl;3
}
int main(){
scanf("%d",&n);
for(int i = 1; i <= n; i++){
scanf("%d",&k);
for(int j = 0; j < k; j++){
scanf("%d",&x);
u[i].insert(x);
}
}
scanf("%d",&m);
int first,second;
for(int i = 0; i < m; i++){
scanf("%d %d",&first,&second);
check(first,second);
}
return 0;
}