Submission #1679030
Source Code Expand
#include<bits/stdc++.h> using namespace std; int N,M; int A[100010],B[100010]; int main() { scanf("%d%d",&N,&M); for(int i = 0; i < N; i++)scanf("%d",A + i); for(int i = 0; i < M; i++)scanf("%d",B + i); sort(A,A + N); sort(B,B + M); int l = 0,mem = 0; for(int i = 0; i < N; i++) { while(l < M && B[l] < A[i])l++; if(l < M && B[l] == A[i])mem++; } printf("%.10lf\n",(double)mem / (double)(N + M - mem)); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - メタ構文変数 |
User | unit |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 507 Byte |
Status | AC |
Exec Time | 37 ms |
Memory | 1024 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:9:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d",&N,&M); ^ ./Main.cpp:10:48: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for(int i = 0; i < N; i++)scanf("%d",A + i); ^ ./Main.cpp:11:48: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for(int i = 0; i < M; i++)scanf("%d",B + i); ^
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 | 256 KB |
subtask1_05.txt | AC | 2 ms | 256 KB |
subtask1_06.txt | AC | 2 ms | 256 KB |
subtask1_07.txt | AC | 2 ms | 256 KB |
subtask1_08.txt | AC | 2 ms | 256 KB |
subtask1_09.txt | AC | 1 ms | 256 KB |
subtask1_10.txt | AC | 2 ms | 256 KB |
subtask2_01.txt | AC | 14 ms | 512 KB |
subtask2_02.txt | AC | 32 ms | 1024 KB |
subtask2_03.txt | AC | 14 ms | 640 KB |
subtask2_04.txt | AC | 32 ms | 1024 KB |
subtask2_05.txt | AC | 9 ms | 384 KB |
subtask2_06.txt | AC | 17 ms | 640 KB |
subtask2_07.txt | AC | 26 ms | 896 KB |
subtask2_08.txt | AC | 33 ms | 1024 KB |
subtask3_01.txt | AC | 24 ms | 768 KB |
subtask3_02.txt | AC | 37 ms | 1024 KB |
subtask3_03.txt | AC | 11 ms | 512 KB |
subtask3_04.txt | AC | 36 ms | 1024 KB |
subtask3_05.txt | AC | 21 ms | 640 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 |