Submission #2548803

Source Code Expand

import collections
N = int(input())
D = [int(i) for i in input().split()]
M = int(input())
T = [int(i) for i in input().split()]

count_D = collections.Counter(D)
count_T = collections.Counter(T)

ans = 'YES'
for k,v in count_T.items():
  if count_D[k] < v:
    ans = 'NO'
    break
print(ans)

Submission Info

Submission Time
Task B - Problem Set
User kenseiQ
Language Python (3.4.3)
Score 200
Code Size 307 Byte
Status AC
Exec Time 303 ms
Memory 57048 KB

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 100 / 100 100 / 100
Status
AC × 4
AC × 13
AC × 27
Set Name Test Cases
sample sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt
dataset1 sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt
dataset2 sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt, 02-10.txt, sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt
Case Name Status Exec Time Memory
01-01.txt AC 21 ms 3316 KB
01-02.txt AC 21 ms 3316 KB
01-03.txt AC 21 ms 3316 KB
01-04.txt AC 21 ms 3316 KB
01-05.txt AC 21 ms 3316 KB
01-06.txt AC 21 ms 3316 KB
01-07.txt AC 21 ms 3316 KB
01-08.txt AC 21 ms 3316 KB
01-09.txt AC 21 ms 3316 KB
02-01.txt AC 115 ms 33204 KB
02-02.txt AC 129 ms 33884 KB
02-03.txt AC 303 ms 57048 KB
02-04.txt AC 121 ms 33884 KB
02-05.txt AC 225 ms 56920 KB
02-06.txt AC 95 ms 27268 KB
02-07.txt AC 158 ms 34760 KB
02-08.txt AC 161 ms 35400 KB
02-09.txt AC 160 ms 33884 KB
02-10.txt AC 169 ms 34160 KB
sample-01.txt AC 21 ms 3316 KB
sample-02.txt AC 21 ms 3316 KB
sample-03.txt AC 21 ms 3316 KB
sample-04.txt AC 21 ms 3316 KB