Submission #1477073

---

Source Code Expand

def scc_puzzle():
	n,m = map(int, raw_input().split(" "))
	max_ans = m/2
	if n>=max_ans:
		print max_ans
		return
	else:
		min_ans = n
		# binary search
		while min_ans+1<max_ans:
			current_ans = (max_ans+min_ans)/2
			if _check(current_ans, n ,m):
				max_ans = current_ans
			else:
				min_ans = current_ans
		# there is no opportunity for max_ans to be an ans
		# however, the min_ans could be, based on our _check() fun
		print min_ans
		return


def _check(ans, n, m):
	total_c = ans*2+(ans-n)*2
	if total_c>m:
		# current ans is too large
		return True
	else:
		return False


if __name__ == "__main__":
	scc_puzzle()

Submission Info

Judge Result