57572023-09-16 22:43:10kristofZsonglőrködéspython3Wrong answer 0/1001.59s50880 KiB
n = int(input())
l = [] #Az összes párok legenerálása

for i in range(n):
    temp = list(map(int, input().split()))
    l.append(temp)

l = sorted(l, key=lambda x: x[1])
o = 0

while len(l) != 0:
    o += 1
    veg = l[0][0]
    del l[0]

    for i in l:
        if i[0] >= veg:
            veg = i[1]
            l.remove(i)
print(o)
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted18ms10820 KiB
2Accepted17ms11032 KiB
subtask20/20
3Wrong answer82ms12468 KiB
4Time limit exceeded1.572s17692 KiB
5Time limit exceeded1.546s37316 KiB
6Time limit exceeded1.574s44312 KiB
7Time limit exceeded1.582s48892 KiB
8Time limit exceeded1.574s49180 KiB
9Time limit exceeded1.582s49636 KiB
10Time limit exceeded1.56s49708 KiB
11Time limit exceeded1.549s50104 KiB
subtask30/35
12Wrong answer17ms12940 KiB
13Wrong answer17ms13032 KiB
14Wrong answer18ms13096 KiB
15Wrong answer23ms13468 KiB
16Wrong answer37ms13536 KiB
17Wrong answer35ms13580 KiB
18Wrong answer37ms13860 KiB
19Wrong answer37ms13876 KiB
20Wrong answer37ms14160 KiB
subtask40/45
21Wrong answer83ms14952 KiB
22Time limit exceeded1.567s19684 KiB
23Time limit exceeded1.554s39532 KiB
24Time limit exceeded1.585s46412 KiB
25Time limit exceeded1.577s50880 KiB
26Time limit exceeded1.58s50676 KiB
27Time limit exceeded1.572s50788 KiB
28Time limit exceeded1.557s50632 KiB
29Time limit exceeded1.59s50684 KiB