Blocked City

CodeChefOpen on judge ↗

Problem description. Democratic party is choosing their MLAs for the election. There are N MLAs and M districts. Each district has an ID number according to the location of the district. The MLAs do not go well with each other. All the MLAs need to be allocated to exactly one district in such a way that the distance between the closest placed MLAs is maximized. Given the number of MLAs N and the

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI