Submission #76930679

Source Code Expand

from collections import defaultdict
n, m = map(int, input().split())
d = defaultdict(int)

for i in range(n):
  l = int(input())
  X = list(map(int, input().split()))
  
  take = 0
  for x in X:
    if d[x] == 0:
      take = x
      d[x] += 1
      break
  
  print(take)

Submission Info

Submission Time
Task D - Greedy Draft
User griez
Language Python (PyPy 3.11-v7.3.20)
Score 200
Code Size 287 Byte
Status AC
Exec Time 73 ms
Memory 101968 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 68 ms 93180 KiB
00-sample-02.txt AC 67 ms 93180 KiB
01-01.txt AC 67 ms 93324 KiB
01-02.txt AC 66 ms 93548 KiB
01-03.txt AC 69 ms 99432 KiB
01-04.txt AC 70 ms 99928 KiB
01-05.txt AC 71 ms 100396 KiB
01-06.txt AC 71 ms 100368 KiB
01-07.txt AC 72 ms 101096 KiB
01-08.txt AC 72 ms 101240 KiB
01-09.txt AC 69 ms 94276 KiB
01-10.txt AC 69 ms 94536 KiB
01-11.txt AC 69 ms 94504 KiB
01-12.txt AC 72 ms 101644 KiB
01-13.txt AC 72 ms 101968 KiB
01-14.txt AC 72 ms 101708 KiB
01-15.txt AC 73 ms 101672 KiB
01-16.txt AC 68 ms 93504 KiB
01-17.txt AC 68 ms 93440 KiB
01-18.txt AC 70 ms 99524 KiB