pta集合相似度_结构相似度

3
3 99 87 101
4 87 101 5 87
7 99 101 18 5 135 18 99
2
1 2
1 3

50.00%
33.33%

#include<bits/stdc++.h>
#define x first
#define y second
#define send string::nops
using namespace std;
typedef long long ll;
const int N = 1e4 + 10;
const int M = 3 * N;
const int INF = 0x3f3f3f3f;
typedef pair<int,int> PII;
typedef struct Node * pnode;
set<int> a[N];
vector<int> aa[N];
int main(){ 
   
    ios::sync_with_stdio(false);
    int n,k,x,y,m;
    cin>>n;
    for(int i = 1;i <= n;i ++){ 
   
        cin>>k;
        for(int j = 0;j < k;j ++){ 
   
            cin>>x;
            a[i].insert(x);
        }
        for(set<int>::iterator it = a[i].begin();it != a[i].end();it ++)aa[i].push_back(*it);
    }
    cin>>m;
    for(int i = 0;i < m;i ++){ 
   
        cin>>x>>y;
        set<int>ss;
        for(int j = 0;j < aa[x].size();j ++){ 
   
            if(a[y].find(aa[x][j]) != a[y].end()){ 
   
                ss.insert(aa[x][j]);
            }
        }
        int com = aa[x].size() + aa[y].size();
        printf("%.2f%%\n",ss.size() / double(com - ss.size())  * 100);
    }

}