Optimal Scheduling

CodeChefOpen on judge ↗

Professor X has to schedule some jobs on a grid of processors. Assume that the execution time of each job scales linearly with the power of the processor. This means, if a particular job takes 2 seconds to finish on a processor with power P, it will take 1 second to finish on a processor with power 2P. He knows the processing power of each processor. Given an array A, containing the execution time

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