Submission #62534042

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<bits/stdc++.h>
#define ll  long long
#define ld long double
#define pb push_back
#define gcd __gcd
#define MOD2 998244353
#define MOD 1000000007
#define inti __int128_t
#define lset 63-__builtin_clzll
#define fset __builtin_ctzll
#define stcnt __builtin_popcountll
#define pll pair<ll,ll>
using namespace std;
 
 
 
int main(){  
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>
#define ll  long long
#define ld long double
#define pb push_back
#define gcd __gcd
#define MOD2 998244353
#define MOD 1000000007
#define inti __int128_t
#define lset 63-__builtin_clzll
#define fset __builtin_ctzll
#define stcnt __builtin_popcountll
#define pll pair<ll,ll>
using namespace std;
 

 
 
int main(){  
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
 
ll t;
t=1;
while(t--){
 
ll n;
cin>>n;
vector<unordered_map<ll,ll>>store(n);
vector<ll>sze(n);
for(ll i=0;i<n;i++){
    ll m;
    cin>>m;
    sze[i]=m;
    for(ll j=0;j<m;j++){
        ll a;
        cin>>a;
        store[i][a]++;
    }
}

ld ans = 0;
for(ll i=0;i<n;i++){
    for(ll j=i+1;j<n;j++){
        ll tot = 0;
        ll comp = sze[i]*sze[j];
        for(auto it:store[i]){
            if(store[j].find(it.first)!=store[j].end()){
                tot+=it.second*store[j][it.first];
            }
        }
        ld poke = (ld)tot/(ld)comp;
        ans=max(ans,poke);
    }
}
cout<<setprecision(10)<<ans<<endl;
}
}

Submission Info

Judge Result