Please don't post hints, spoilers, codes or ask for help before the contest ends. If you do that, you might get disqualified.

Please read the FAQ page before asking any questions.

The meaning of different verdicts like segmentation fault, abort called, etc., can be found here.

Here is a fact: even you do type 1 operation by adding 1 to each number in the range, the needed time beyond the time limit. So, take more considerations.

Its depressing when the code working perfectly, and only two tests passes. Even after using DP for factorials and different algorithmic functions for better efficiency, I still could not pass all. :(

Here is my approach.

For each value less than 40 maintain an ordered array of indices such that .

For operation 1 we need to replace a range of indices in each array with the corresponding range of array , for operation 2 we take the sum of times the length of the range of the corresponding array for all , for operation 3 we delete the index from an array if the previous value was less than 40 and insert the index into an array if the new value is less that 40.

Solution

only 1st test case is passed and 1 test case failed and rest are T.O. I am using python any suggestions?