Submission #1229740

---

Source Code Expand

#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
using namespace std;
typedef long long ll;

set <ll> s;
map<ll,ll> m;

int main()
{
	int Na, Nb; cin >> Na >> Nb;
	double res = 0;

	for (int i = 0; i < Na; i++) {
		ll a;   cin >> a;
		m[a]++;
		s.insert(a);
	}

	for (int i = 0; i < Nb; i++) {
		ll b;   cin >> b;
		if (m.count(b) != 0)res++;
		s.insert(b);
	}
	printf("%.15f\n",res/s.size());
	return 0;
}

Submission Info

Judge Result