Submission #74675153

Source Code Expand

N = int(input())
Bs = []
len_key = tuple(([] for _ in range(10)))
for i in range(N):
    Ai, Bi = map(int, input().split())
    Bs.append(Bi-1)
    len_key[Ai-1].append(i)
M = int(input())
Ss = []
kss = tuple((set()for _ in range(10)))#koho_sets
for jj in range(M):
    Sj = input()
    Ss.append(Sj)
    for i in len_key[len(Sj)-1]:
        kss[i].add(Sj[Bs[i]])
yn = ("No", "Yes")
for Sj in Ss:
    bl = (len(Sj)==N and all(((i in kss[n])for n, i in enumerate(Sj))))
    print(yn[bl])

Submission Info

Submission Time
Task C - Fishbones
User hydroxed_sil
Language Python (CPython 3.13.7)
Score 300
Code Size 504 Byte
Status AC
Exec Time 542 ms
Memory 23644 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 25
Set Name Test Cases
Sample 00-sample-01.txt, 00-sample-02.txt
All 00-sample-01.txt, 00-sample-02.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, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt
Case Name Status Exec Time Memory
00-sample-01.txt AC 12 ms 9080 KiB
00-sample-02.txt AC 12 ms 9080 KiB
01-01.txt AC 38 ms 10920 KiB
01-02.txt AC 122 ms 16084 KiB
01-03.txt AC 213 ms 21128 KiB
01-04.txt AC 135 ms 15984 KiB
01-05.txt AC 189 ms 18428 KiB
01-06.txt AC 161 ms 17012 KiB
01-07.txt AC 494 ms 23504 KiB
01-08.txt AC 505 ms 23504 KiB
01-09.txt AC 41 ms 10820 KiB
01-10.txt AC 138 ms 16204 KiB
01-11.txt AC 41 ms 10876 KiB
01-12.txt AC 218 ms 20028 KiB
01-13.txt AC 160 ms 17032 KiB
01-14.txt AC 135 ms 15644 KiB
01-15.txt AC 466 ms 23416 KiB
01-16.txt AC 496 ms 23432 KiB
01-17.txt AC 500 ms 23548 KiB
01-18.txt AC 542 ms 23504 KiB
01-19.txt AC 504 ms 23460 KiB
01-20.txt AC 509 ms 23432 KiB
01-21.txt AC 496 ms 23628 KiB
01-22.txt AC 495 ms 23552 KiB
01-23.txt AC 506 ms 23644 KiB