Tricky Theft
CodeChefOpen on judge ↗
A jewellery shop owned by Mr.Mallya has $N$ diamonds numbered $1, 2, 3,....N$. The coordinates of diamond $i$ are ($x_i$,$y_i$) (the shop can be regarded as a 2d plane) and the value of the diamond is $v_i$. You want to steal some of these diamonds and give it to the poor. There are M conditions, Condition $1,2,...,M,$ that must be met when stealing diamonds, or you will be caught by the detectiv
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.
Sign in to chat with the tutor and save your progress.
Sign in to start