6303 | 2023-11-15 16:11:49 | Zsombor0707 | Formula-1 | python3 | Wrong answer 0/100 | 18ms | 13400 KiB |
# Source: https://usaco.guide/general/io
N = int(input())
H = input()
V = input()
Vt = V.split()
Ht = H.split()
#ide jön a győztes ami úgy lesz hogy a lista elemeit összeadjuk és megnezzuk melyik a nagyobb
Vi = 0
for i in Vt:
Vi += int(i)
Hi = 0
for i in Ht:
Hi += int(i)
if (Vi > Hi):
print("Hamilton")
else:
print("Verstappen")
#itt kell kiírni a leggyorsabb kört
Vmax = max(Vt)
Hmax = max(Ht)
if (Vmax > Hmax):
print("Verstappen")
else:
print("Hamilton")
Subtask | Sum | Test | Verdict | Time | Memory | ||
---|---|---|---|---|---|---|---|
subtask1 | 0/0 | ||||||
1 | Accepted | 17ms | 10956 KiB | ||||
2 | Accepted | 17ms | 11360 KiB | ||||
subtask2 | 0/10 | ||||||
3 | Wrong answer | 17ms | 11760 KiB | ||||
4 | Wrong answer | 17ms | 12000 KiB | ||||
5 | Wrong answer | 17ms | 12192 KiB | ||||
6 | Wrong answer | 17ms | 12308 KiB | ||||
subtask3 | 0/15 | ||||||
7 | Wrong answer | 17ms | 12472 KiB | ||||
8 | Accepted | 17ms | 12612 KiB | ||||
9 | Accepted | 17ms | 12724 KiB | ||||
10 | Wrong answer | 17ms | 12604 KiB | ||||
11 | Accepted | 17ms | 13060 KiB | ||||
subtask4 | 0/20 | ||||||
12 | Wrong answer | 17ms | 12616 KiB | ||||
13 | Accepted | 17ms | 12788 KiB | ||||
14 | Wrong answer | 17ms | 12856 KiB | ||||
15 | Wrong answer | 17ms | 12988 KiB | ||||
16 | Accepted | 17ms | 12784 KiB | ||||
17 | Accepted | 17ms | 12996 KiB | ||||
18 | Accepted | 17ms | 12984 KiB | ||||
19 | Wrong answer | 17ms | 13400 KiB | ||||
subtask5 | 0/55 | ||||||
20 | Accepted | 17ms | 13224 KiB | ||||
21 | Accepted | 17ms | 13400 KiB | ||||
22 | Wrong answer | 17ms | 13372 KiB | ||||
23 | Accepted | 17ms | 13304 KiB | ||||
24 | Accepted | 17ms | 13248 KiB | ||||
25 | Wrong answer | 17ms | 13376 KiB | ||||
26 | Accepted | 17ms | 13372 KiB | ||||
27 | Accepted | 18ms | 13220 KiB | ||||
28 | Accepted | 17ms | 13392 KiB |