Submission #1358733

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i,n) for(int i=0;i<(int)n;++i)

int main(){
    int NA, NB;
    cin >> NA >> NB;
    set<ll> st;
    REP(i, NA){
        ll A;
        cin >> A;
        st.insert(A);
    }
    ll x=0, y=NA;
    REP(i, NB){
        ll B;
        cin >> B;
        if(st.find(B)!=st.end()){
            x++;
        }else{
            y++;
        }
    }
    printf("%.10f\n", (1.0*x)/y);
    return 0;
}

Submission Info

Judge Result