Editorial for SCC25 Contest 1 P3 - Cauldron Counting
Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.
Submitting an official solution before solving the problem yourself is a bannable offence.
Author:
Subtask 1 [30%]
This subtask was meant for any solutions that used 32 bit integers.
Time Complexity: \(O(N)\)
Subtask 2 [70%]
Simply brute force every possible speed increment or decrement. 64 bit integers are required.
Time Complexity: \(O(N)\)
Comments