Submission #6,304

2023-11-15 16:21:39

python3

Accepted 100/100

17ms

14104 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 kissebb
Vmax = 111111111111111111111111110
Hmax = 111111111111111111111111110
Vi = 0
for i in Vt:
	Vi += int(i)
	if (int(i) < Vmax):
		Vmax = int(i)

Hi = 0
for i in Ht:
	Hi += int(i)
	if (int(i) < Hmax):
		Hmax = int(i)

if (Vi > Hi):
	print("Hamilton")

else:
	print("Verstappen")

#itt kell kiírni a leggyorsabb kört

if (Vmax < Hmax):
	print("Verstappen")

else: 
	print("Hamilton")

	Sum	Test	Verdict	Time	Memory
subtask1	0/0
		1	Accepted	17ms	11160 KiB
		2	Accepted	17ms	11076 KiB
subtask2	10/10
		3	Accepted	17ms	11360 KiB
		4	Accepted	17ms	11816 KiB
		5	Accepted	17ms	11964 KiB
		6	Accepted	17ms	12272 KiB
subtask3	15/15
		7	Accepted	17ms	12340 KiB
		8	Accepted	17ms	12496 KiB
		9	Accepted	17ms	12752 KiB
		10	Accepted	17ms	12888 KiB
		11	Accepted	17ms	13056 KiB
subtask4	20/20
		12	Accepted	17ms	13396 KiB
		13	Accepted	17ms	13388 KiB
		14	Accepted	17ms	13156 KiB
		15	Accepted	17ms	13456 KiB
		16	Accepted	17ms	13404 KiB
		17	Accepted	17ms	14040 KiB
		18	Accepted	17ms	13836 KiB
		19	Accepted	17ms	13892 KiB
subtask5	55/55
		20	Accepted	17ms	13884 KiB
		21	Accepted	17ms	13732 KiB
		22	Accepted	17ms	13952 KiB
		23	Accepted	17ms	14104 KiB
		24	Accepted	17ms	13964 KiB
		25	Accepted	17ms	13852 KiB
		26	Accepted	17ms	13804 KiB
		27	Accepted	17ms	13940 KiB
		28	Accepted	17ms	13860 KiB