Submission #38387548
Source Code Expand
import sys
N, M = map(int, input().split())
S = []
T = []
count = 0
for i in range(N):
S.append(input()[3:])
for i in range(M):
T.append(input())
for i in range(N):
for j in range(M):
if (S[i] == T[j]):
count += 1
break
print(count)
Submission Info
| Submission Time | |
|---|---|
| Task | B - Postal Card |
| User | bobslay |
| Language | Python (3.8.2) |
| Score | 200 |
| Code Size | 306 Byte |
| Status | AC |
| Exec Time | 80 ms |
| Memory | 9024 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 200 / 200 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | 00_example_00.txt, 00_example_01.txt, 00_example_02.txt |
| All | 00_example_00.txt, 00_example_01.txt, 00_example_02.txt, 01_all_00.txt, 02_none_00.txt, 03_random_00.txt, 03_random_01.txt, 03_random_02.txt, 03_random_03.txt, 03_random_04.txt, 03_random_05.txt, 03_random_06.txt, 03_random_07.txt, 03_random_08.txt, 03_random_09.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| 00_example_00.txt | AC | 28 ms | 8960 KiB |
| 00_example_01.txt | AC | 25 ms | 8964 KiB |
| 00_example_02.txt | AC | 21 ms | 8864 KiB |
| 01_all_00.txt | AC | 75 ms | 9024 KiB |
| 02_none_00.txt | AC | 76 ms | 8876 KiB |
| 03_random_00.txt | AC | 80 ms | 9008 KiB |
| 03_random_01.txt | AC | 46 ms | 8796 KiB |
| 03_random_02.txt | AC | 55 ms | 8944 KiB |
| 03_random_03.txt | AC | 34 ms | 8940 KiB |
| 03_random_04.txt | AC | 50 ms | 8904 KiB |
| 03_random_05.txt | AC | 60 ms | 8868 KiB |
| 03_random_06.txt | AC | 26 ms | 8828 KiB |
| 03_random_07.txt | AC | 56 ms | 8776 KiB |
| 03_random_08.txt | AC | 44 ms | 8776 KiB |
| 03_random_09.txt | AC | 61 ms | 8940 KiB |