Submission #1293344

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(i=0;i<n;i++)
#define loop(i,a,n) for(i=a;i<n;i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

typedef vector<int> vi;
typedef pair<int,int> pii;

int main(void) {
  int i,j;
  int na,nb;
  cin>>na>>nb;
  vi a(na),b(nb);
  rep(i,na)cin>>a[i];
  rep(i,nb)cin>>b[i];

  sort(all(a));
  sort(all(b));
  a.erase(unique(all(a)),a.end());
  b.erase(unique(all(b)),b.end());

  rep(i,b.size())
    a.push_back(b[i]);

  int sum=a.size();
  sort(all(a));
  int intersection=0;
  rep(i,a.size()-1)
    if(a[i]==a[i+1])intersection++;

  cout<<shosu(10)<<1.0*intersection/(sum-intersection)<<endl;
}

Submission Info

Judge Result