Time Traveller

CodeChefOpen on judge ↗

The famous time traveller, Paradox, is travelling in an old time machine that can only move forwards in space and time. He will cross $N$ pick up points $P_1$, $P_2$, …$P_N$ before reaching his destination. Paradox aims to collect as many tachyons as he can on the way. At time $t$, $x$ tachyons appear at point $P_i$. Similarly, there are $K$ tuples <$t$, $x$, $P_i$> indicating number of tachyon

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