题解:AT_arc033_2 [ARC033B] メタ構文変数
涉及知识点:
set
。
解题思路
为什么要用 set
呢?因为 set
可以去重!
令 \(s1\) 与 \(s2\) 均为 set
。
\(|a \cap b|\) 相当于把 \(a\) 数组和 \(b\) 数组的元素放进 \(s1\) 里的长度。
\(|a \cup b|\) 相当于把 \(a\) 和 \(b\) 都有的元素放进 \(s2\) 里的长度。
最后直接相除输出即可。
代码
#include <bits/stdc++.h>
#define int long long
#define ll __int128
#define db double
#define ldb long double
#define vo void
#define endl '\n'
#define il inline
#define re register
#define ve vector
#define p_q priority_queue
#define PII pair<int, int>
using namespace std;
//#define O2 1
#ifdef O2
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3, "Ofast", "inline")
#endif
namespace OI {
template <typename T>
il T read() {
T x = 0, f = 1;
int ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = (x << 3) + (x << 1) + (ch ^ 48);
ch = getchar();
}
return x * f;
}
template <typename TE>
il void write(TE x) {
if (x < 0) {
x = -x;
putchar('-');
}
TE sta[35];
int top = 0;
do {
sta[top++] = x % 10, x /= 10;
} while (x);
while (top) putchar(sta[--top] + '0');
}
il string read_with_string() {
string s = "";
char ch = getchar();
while ((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z') || (ch >= '0' && ch <= '9')) {
s += ch;
ch = getchar();
}
return s;
}
il void write_with_string(string s) {
for (int i = 0; i < s.size(); i ++ ) putchar(s[i]);
}
}
namespace COMB {
int fact[200000];
int Triangle[1010][1010];
void Fact(int n, int mod) {
fact[0] = 1;
for (int i = 1; i <= n; i ++ ) fact[i] = ((fact[i - 1]) % mod * (i % mod)) % mod;
}
void Pascal_s_triangle(int n, int mod) {
for (int i = 0; i <= n; i ++ ) Triangle[i][0] = 1;
for (int i = 1; i <= n; i ++ )
for (int j = 1; j <= i; j ++ )
Triangle[i][j] = (Triangle[i - 1][j] + Triangle[i - 1][j - 1]) % mod;
}
int pw(int x, int y, int mod) {
int res = 1;
while (y) {
if (y & 1) res = ((res % mod) * (x % mod)) % mod;
x = (x % mod) * (x % mod) % mod;
y >>= 1;
}
return res;
}
int pw(int x, int y) {
int res = 1;
while (y) {
if (y & 1) res *= x;
x *= x;
y >>= 1;
}
}
int GCD(int x, int y, int mod) {
return __gcd(x, y) % mod;
}
int LCM(int x, int y, int mod) {
return (((x % mod) * (y % mod)) % mod / (GCD(x, y, mod) % mod)) % mod;
}
int C(int n, int m, int mod) {
if (m > n || m < 0) return 0;
return fact[n] * pw(fact[m], mod - 2, mod) % mod * pw(fact[n - m], mod - 2, mod) % mod;
}
int Ask_triangle(int x, int y) {
return Triangle[x][y];
}
}
using namespace OI;
using namespace COMB;
//#define fre 1
#define IOS 1
//#define multitest 1
const int N = 2e5 + 10;
const int M = 4e5 + 10;
const int inf = 1e12;
int n, m;
int a[N], b[N];
set<int> s1, s2, A, B;
il void Init() {
cin >> n >> m;
for (int i = 1; i <= n; i ++ ) cin >> a[i];
for (int i = 1; i <= m; i ++ ) cin >> b[i];
}
il void Solve() {
for (int i = 1; i <= n; i ++ ) s1.insert(a[i]), A.insert(a[i]);
for (int i = 1; i <= m; i ++ ) s1.insert(b[i]), B.insert(b[i]);
for (auto x : A)
if (B.find(x) != B.end())
s2.insert(x);
printf("%.10lf", (db)(s2.size()) / (db)(s1.size()));
}
signed main() {
int T;
#ifdef IOS
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#endif
#ifdef fre
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
#endif
#ifdef multitest
cin >> T;
#else
T = 1;
#endif
while (T--) {
Init();
Solve();
}
return 0;
}
/*
*/