제출 #980619

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
980619		brijeshSiwach	Balloons (CEOI11_bal)	Cpython 3	10 / 100	858 ms	55812 KiB

bal

import random
import time

random.seed(time.time())



def solve():
   	n=int(input())
   	a=[list(map(int,input().split())) for _ in range(n)]
   	ans = [0]*(n)
   	
   	stack = []
   	def find(i: int, j: int):
   		return ((a[j][0]-a[i][0])**2) / (4*ans[j])


   	for i in range(n):
   		r = a[i][1]
   		while len(stack) > 0:
   			cr = find(i, stack[-1])
   			if cr <= r:
   				r = cr
   				stack.pop()
   			else:
   				break

   		ans[i] = r
   		stack.append(i)

   	print(*ans, sep="\n")


if __name__ == '__main__':
	t = 1
	# print(t)
	while t > 0:
		t -= 1
		solve()

• Subtask 1: 0 / 10
• Subtask 2: 10 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10