Find a special connected block

CodeChefRating 2949Open on judge ↗

Given an n*m board with a number between -1 and n*m in every entries. And an n*m matrix M is also given, where Mi,j is the cost of selecting the (i,j) entry of the given board. Your task is to find a connected block (which means these entries can reach each other by just go up, down, left and right without going out the block) in the board that contains at least K distinct positive numbers witho

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