Submission #1371260
Source Code Expand
#include <bits/stdc++.h> #define FOR(i,a,b) for(int i=a; i<b; i++) #define REP(i,n) FOR(i,0,n) //#define int long long typedef long long ll; const ll INF = 1e18; using namespace std; signed main() { int NA, NB; set<int> SA, SAB; int temp; int num = 0; cin >> NA >> NB; REP(i,NA) { cin >> temp; SA.insert(temp); SAB.insert(temp); } REP(i,NB) { cin >> temp; SAB.insert(temp); if (SA.find(temp) != SA.end()) num++; } printf("%.10lf\n", 1.0 * num / SAB.size()); }
Submission Info
Submission Time | |
---|---|
Task | B - メタ構文変数 |
User | hiyokko2 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 588 Byte |
Status | AC |
Exec Time | 207 ms |
Memory | 14336 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 | 2 ms | 384 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 | 2 ms | 384 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 | 64 ms | 4864 KB |
subtask2_02.txt | AC | 165 ms | 9600 KB |
subtask2_03.txt | AC | 65 ms | 4352 KB |
subtask2_04.txt | AC | 168 ms | 9600 KB |
subtask2_05.txt | AC | 37 ms | 3712 KB |
subtask2_06.txt | AC | 84 ms | 7296 KB |
subtask2_07.txt | AC | 131 ms | 8576 KB |
subtask2_08.txt | AC | 167 ms | 9600 KB |
subtask3_01.txt | AC | 132 ms | 9216 KB |
subtask3_02.txt | AC | 207 ms | 14336 KB |
subtask3_03.txt | AC | 46 ms | 2816 KB |
subtask3_04.txt | AC | 189 ms | 9600 KB |
subtask3_05.txt | AC | 113 ms | 9600 KB |
subtask3_06.txt | AC | 207 ms | 14336 KB |
subtask3_07.txt | AC | 139 ms | 10624 KB |
subtask3_08.txt | AC | 197 ms | 11392 KB |