Submission #1353424
Source Code Expand
#include<bits/stdc++.h> using namespace std; #define REP(i,s,n) for(int i=s;i<n;++i) #define rep(i,n) REP(i,0,n) #define SORT(c) sort((c).begin(),(c).end()) #define IINF INT_MAX #define LLINF LLONG_MAX typedef long long ll; typedef pair<int, int> ii; int main() { int na, nb; cin >> na >> nb; set<int> meta; set<int> dual; rep(i, na){ int a; cin >> a; meta.insert(a); } rep(i, nb){ int b; cin >> b; if(meta.find(b) != meta.end()){ dual.insert(b); } else meta.insert(b); } printf("%.8lf\n", 1.0 * dual.size()/ meta.size()); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - メタ構文変数 |
User | letter |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 615 Byte |
Status | AC |
Exec Time | 175 ms |
Memory | 9728 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 | 2 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 | 256 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 | 55 ms | 4096 KB |
subtask2_02.txt | AC | 153 ms | 9600 KB |
subtask2_03.txt | AC | 60 ms | 4352 KB |
subtask2_04.txt | AC | 152 ms | 9600 KB |
subtask2_05.txt | AC | 29 ms | 2432 KB |
subtask2_06.txt | AC | 65 ms | 4992 KB |
subtask2_07.txt | AC | 114 ms | 7680 KB |
subtask2_08.txt | AC | 152 ms | 9728 KB |
subtask3_01.txt | AC | 98 ms | 6144 KB |
subtask3_02.txt | AC | 162 ms | 9600 KB |
subtask3_03.txt | AC | 42 ms | 2816 KB |
subtask3_04.txt | AC | 175 ms | 9600 KB |
subtask3_05.txt | AC | 85 ms | 5632 KB |
subtask3_06.txt | AC | 162 ms | 9600 KB |
subtask3_07.txt | AC | 108 ms | 6784 KB |
subtask3_08.txt | AC | 170 ms | 9600 KB |