If the current rectangle contains ships, subdivide it into 4 smaller ones untilĢ) the current rectangle is a single point (e.g. In other words, you must find the answer using the given hasShips API, without knowing the ships position.

On the input ships is only given to initialize the map internally. You must solve this problem “blindfolded”.

you know the government has a separate agenda and its to divide and conquer. Ships = ,], topRight =, bottomLeft = Įxplanation: From to we can count 3 ships within the range. Rated 4.5 out of 5 based on 2 customer ratings. Also, any solutions that attempt to circumvent the judge will result in disqualification. Submissions making more than 400 calls to hasShips will be judged Wrong Answer. It is guaranteed that there are at most 10 ships in that rectangle. Given two points, which are the top right and bottom left corners of a rectangle, return the number of ships present in that rectangle. You have a function Sea.hasShips(topRight, bottomLeft) which takes two points as arguments and returns true if and only if there is at least one ship in the rectangle represented by the two points, including on the boundary. On the sea represented by a cartesian plane, each ship is located at an integer point, and each integer point may contain at most 1 ship.

We break the problem into aproblems, by dividing the input into bchunks. Let’s say that D(n) is the time it takes to divide into subproblems. with their tactics of divide and conquer which would reduce the Celts to slavery if they allowed it to keep happening. (This problem is an interactive problem.) 10.2.5 Divide and Conquer Runtime (Generally) A divide and conquer algorithm has 3 steps: divide into subproblems, solve the subproblems, combine to solve the original problem.

Divide and conquer 4.5