Submission #76930072

Source Code Expand

n,m = map(int,input().split())
juce = [i+1 for i in range(m)]
use = set()
for _ in range(n):
    l = int(input())
    x = list(map(int,input().split()))
    
    for i in x:
        if not i in use:
            print(i)
            use.add(i)
            break
    else:
        print(0)

Submission Info

Submission Time
Task D - Greedy Draft
User TravelSashimi
Language Python (CPython 3.13.7)
Score 200
Code Size 302 Byte
Status AC
Exec Time 11 ms
Memory 9172 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 10 ms 8932 KiB
00-sample-02.txt AC 10 ms 8976 KiB
01-01.txt AC 10 ms 9156 KiB
01-02.txt AC 10 ms 9148 KiB
01-03.txt AC 10 ms 8976 KiB
01-04.txt AC 10 ms 9148 KiB
01-05.txt AC 11 ms 9172 KiB
01-06.txt AC 11 ms 8992 KiB
01-07.txt AC 11 ms 8992 KiB
01-08.txt AC 11 ms 8940 KiB
01-09.txt AC 10 ms 9148 KiB
01-10.txt AC 10 ms 8940 KiB
01-11.txt AC 11 ms 8976 KiB
01-12.txt AC 11 ms 9052 KiB
01-13.txt AC 11 ms 9172 KiB
01-14.txt AC 11 ms 9148 KiB
01-15.txt AC 11 ms 8940 KiB
01-16.txt AC 10 ms 8940 KiB
01-17.txt AC 10 ms 8932 KiB
01-18.txt AC 10 ms 9156 KiB