Submission #1356392


Source Code Expand

#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>

using namespace std;

#ifndef _DEBUG
#define main_ main
#endif
#define FOR(i,s,e) for (int i = int(s); i < int(e); ++i)
#define REP(i,e) FOR(i,0,e)
#define INF (INT_MAX/2)
#define EPS (1.0e-8)
#define LINF (LONG_MAX/2)

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<bool> vb;
typedef vector<string> vs;

template <typename T>
using keyVal = pair<string, T>;
template<typename T>
bool val_greater(const keyVal<T>& left, const keyVal<T>& right) {
	return left.second > right.second;
}

vs split(string str, char sep) {
	vs v; stringstream ss(str); string t;
	while (getline(ss, t, sep)) v.push_back(t);
	return v;
}

int main_() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int NA, NB; cin >> NA >> NB;
	vi A(NA), B(NB);
	FOR(i, 0, NA) cin >> A[i];
	FOR(i, 0, NB) cin >> B[i];

	sort(B.begin(), B.end());

	int cnt = 0;
	FOR(i, 0, NA) {
		int a = A[i];
		if (binary_search(B.begin(), B.end(), a)) {
			cnt++;
		}
	}

	double ans = ((double)cnt) / (NA + NB - cnt);
	cout << setprecision(8) << ans << endl;

	return 0;
}

Submission Info

Submission Time
Task B - メタ構文変数
User apprec
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1342 Byte
Status AC
Exec Time 37 ms
Memory 1024 KB

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3
Score / Max Score 0 / 0 40 / 40 30 / 30 30 / 30
Status
AC × 2
AC × 11
AC × 19
AC × 28
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
Subtask1 sample_01.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt
Subtask2 sample_01.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt
Subtask3 sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask3_01.txt, subtask3_02.txt, subtask3_03.txt, subtask3_04.txt, subtask3_05.txt, subtask3_06.txt, subtask3_07.txt, subtask3_08.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
subtask1_01.txt AC 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt AC 2 ms 256 KB
subtask1_05.txt AC 1 ms 256 KB
subtask1_06.txt AC 2 ms 256 KB
subtask1_07.txt AC 1 ms 256 KB
subtask1_08.txt AC 2 ms 256 KB
subtask1_09.txt AC 1 ms 256 KB
subtask1_10.txt AC 1 ms 256 KB
subtask2_01.txt AC 13 ms 640 KB
subtask2_02.txt AC 33 ms 1024 KB
subtask2_03.txt AC 14 ms 640 KB
subtask2_04.txt AC 33 ms 1024 KB
subtask2_05.txt AC 8 ms 512 KB
subtask2_06.txt AC 16 ms 640 KB
subtask2_07.txt AC 26 ms 896 KB
subtask2_08.txt AC 33 ms 1024 KB
subtask3_01.txt AC 23 ms 768 KB
subtask3_02.txt AC 37 ms 1024 KB
subtask3_03.txt AC 11 ms 512 KB
subtask3_04.txt AC 37 ms 1024 KB
subtask3_05.txt AC 21 ms 768 KB
subtask3_06.txt AC 37 ms 1024 KB
subtask3_07.txt AC 26 ms 768 KB
subtask3_08.txt AC 37 ms 1024 KB