Submission #20531690

Source Code Expand

import math
n=int(input())
A=[0]*n
P=[0]*n
X=[0]*n
min=999999999
for i in range(n):
	B=[int(i) for i in input().split()]
	A[i]=B[0]
	P[i]=B[1]
	X[i]=B[2]
	
	if X[i]>0:
		X[i]-=1
		A[i]-=0.5
	else:
		A[i]=999999999
		
	if X[i]>A[i] and min>P[i]:
		min=P[i]

if min==999999999:
	print("-1")
else:
	print(min)

Submission Info

Submission Time
Task B - Play Snuke
User spade
Language Python (3.8.2)
Score 200
Code Size 330 Byte
Status AC
Exec Time 279 ms
Memory 20604 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 18
Set Name Test Cases
Sample 01_sample.txt, 02_sample.txt, 03_sample.txt
All 01_sample.txt, 02_sample.txt, 03_sample.txt, 04_small.txt, 05_small.txt, 06_small.txt, 07_small.txt, 08_small.txt, 09_large.txt, 10_large.txt, 11_large.txt, 12_large.txt, 13_large.txt, 14_ng.txt, 15_ng.txt, 16_max.txt, 17_max.txt, 18_max.txt
Case Name Status Exec Time Memory
01_sample.txt AC 30 ms 8920 KiB
02_sample.txt AC 27 ms 9020 KiB
03_sample.txt AC 19 ms 9152 KiB
04_small.txt AC 19 ms 9068 KiB
05_small.txt AC 19 ms 8920 KiB
06_small.txt AC 24 ms 9144 KiB
07_small.txt AC 21 ms 9140 KiB
08_small.txt AC 27 ms 9072 KiB
09_large.txt AC 100 ms 12256 KiB
10_large.txt AC 151 ms 14620 KiB
11_large.txt AC 141 ms 14216 KiB
12_large.txt AC 136 ms 14000 KiB
13_large.txt AC 71 ms 10924 KiB
14_ng.txt AC 30 ms 9256 KiB
15_ng.txt AC 121 ms 13472 KiB
16_max.txt AC 267 ms 20600 KiB
17_max.txt AC 268 ms 20552 KiB
18_max.txt AC 279 ms 20604 KiB