I can't get any idea about how to solve this problem efficiently with the given constraints.What are the algorithms necessary for solving this?I know Convex hull and SAT also but I am not getting how to use them here.Any help will be appreciated.Problem - TBGAME
Thanks
I don't know what SAT is, but convex hull is definitely useful here. There's not really much more hint that can be given without solving the problem for you.
@leppyr64 Separation Axis Theorem(SAT) to check whether two convex hulls intersect or not.But I think I get what I should do.Thanks anyways.I will try it now.
Sure, after a quick read I guess SAT is useful here, but this problem doesn't require it's level of complexity.
@leppyr64 Thanks, the problem is solved.I got AC .SAT was never required and wouldn't have worked either.