Submission #73488722

Source Code Expand

NM = list(map(int, input().split()))
Drink = [i for i in range(1,NM[1]+1)]
X = []
for i in range(NM[0]):
  L = input()
  X=list(map(int,input().split()))
  for j in X:
    if j in Drink:
      Drink[Drink.index(j)] = 0
      print(j)
      break
  else:
    print(0)

Submission Info

Submission Time
Task B - Greedy Draft
User maybeSuima
Language Python (PyPy 3.11-v7.3.20)
Score 200
Code Size 284 Byte
Status AC
Exec Time 64 ms
Memory 88024 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 20
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
Case Name Status Exec Time Memory
00-sample-01.txt AC 57 ms 79640 KiB
00-sample-02.txt AC 57 ms 79548 KiB
01-01.txt AC 57 ms 79420 KiB
01-02.txt AC 57 ms 79728 KiB
01-03.txt AC 61 ms 85840 KiB
01-04.txt AC 61 ms 85776 KiB
01-05.txt AC 62 ms 86516 KiB
01-06.txt AC 61 ms 86832 KiB
01-07.txt AC 63 ms 86924 KiB
01-08.txt AC 62 ms 87468 KiB
01-09.txt AC 59 ms 80404 KiB
01-10.txt AC 59 ms 80444 KiB
01-11.txt AC 59 ms 80444 KiB
01-12.txt AC 64 ms 87968 KiB
01-13.txt AC 64 ms 88024 KiB
01-14.txt AC 64 ms 87556 KiB
01-15.txt AC 64 ms 87796 KiB
01-16.txt AC 58 ms 79684 KiB
01-17.txt AC 57 ms 79564 KiB
01-18.txt AC 60 ms 85516 KiB