Submission #1356447
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); set<int> st; FOR(i, 0, NA) { cin >> A[i]; st.insert(A[i]); } FOR(i, 0, NB) { cin >> B[i]; st.insert(B[i]); } double sz = st.size(); double ans = (NA + NB - sz) / sz; 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 | 1279 Byte |
Status | AC |
Exec Time | 97 ms |
Memory | 10368 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | Subtask3 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 40 / 40 | 30 / 30 | 30 / 30 | ||||||||
Status |
|
|
|
|
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 | 384 KB |
subtask1_05.txt | AC | 2 ms | 256 KB |
subtask1_06.txt | AC | 2 ms | 384 KB |
subtask1_07.txt | AC | 2 ms | 384 KB |
subtask1_08.txt | AC | 2 ms | 384 KB |
subtask1_09.txt | AC | 1 ms | 256 KB |
subtask1_10.txt | AC | 2 ms | 384 KB |
subtask2_01.txt | AC | 33 ms | 3712 KB |
subtask2_02.txt | AC | 75 ms | 5760 KB |
subtask2_03.txt | AC | 28 ms | 2688 KB |
subtask2_04.txt | AC | 74 ms | 5760 KB |
subtask2_05.txt | AC | 19 ms | 2688 KB |
subtask2_06.txt | AC | 41 ms | 5376 KB |
subtask2_07.txt | AC | 59 ms | 5248 KB |
subtask2_08.txt | AC | 74 ms | 5760 KB |
subtask3_01.txt | AC | 56 ms | 6656 KB |
subtask3_02.txt | AC | 96 ms | 10368 KB |
subtask3_03.txt | AC | 20 ms | 1792 KB |
subtask3_04.txt | AC | 79 ms | 5760 KB |
subtask3_05.txt | AC | 56 ms | 6016 KB |
subtask3_06.txt | AC | 97 ms | 10368 KB |
subtask3_07.txt | AC | 61 ms | 6656 KB |
subtask3_08.txt | AC | 90 ms | 7552 KB |