Submission #1651382

---

Source Code Expand

#include <cstdlib>
#include <cmath>
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <cstring>
#include <string>
#include <map>
#include <list>
#define MOD 1000000007
#define INF 1000000000
typedef long long ll;
using namespace std;
typedef pair<int,int> P;

int main(void){
    int a,b;
    int bunsi=0,bunbo;
    map<int,bool>ma;
    map<int,int>uni;
    cin>>a>>b;
    for(int i=0;i<a;i++){
        int p;
        cin>>p;
        ma[p]=true;
    }
    bunbo=a;
    for(int i=0;i<b;i++){
        int p;
        cin>>p;
        if(ma[p])bunsi++;
        else bunbo++;
    }
    printf("%.8lf\n",double(bunsi)/bunbo);
    return 0;
}

Submission Info

Judge Result