Dark Distance

CodeChefOpen on judge ↗

After years of research Dr. R D Sharma has found a new distance called Dark distance in 2D plane. Now he wants you to write a code to find the dark distance. Dark distance is defined below:- Dark Distance between polygon A and B = MAX{D(A,B),D{B,A)} where D(A,B) = MAX { MIN {d(x,y)}} , where x ϵ {vertices of A} and y ϵ {vertices of B} - d (x, y) denotes the Euclidean distance between points x and

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