← All problemsSign in

Parry It! (Hard)

CodeChefRating 2520Open on judge ↗

**This is the hard version of the problem. In this version, you need to answer for each index $i$ whether a maximal sequence of parries including that index exists.** Chef is playing a videogame, and fighting a particularly difficult boss. After several tries, Chef has learned the attack patterns of the boss and knows exactly what to expect. The boss will perform $N$ attacks, in order. Each at

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