← All problemsSign in

3594. Minimum Time to Transport All Individuals

LeetCodeArrayBit ManipulationGraph TheoryHeap (Priority Queue)Shortest PathBitmaskOpen on judge ↗

You are given n individuals at a base camp who need to cross a river to reach a destination using a single boat. The boat can carry at most k people at a time. The trip is affected by environmental conditions that vary cyclically over m stages. Each stage j has a speed multiplier mul[j]: - If mul[j] > 1, the trip slows down. - If mul[j] < 1, the trip speeds up. Each individual i has a rowing s

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

Sign in to chat with the tutor and save your progress.

Sign in to start