MagicSpark's blog

By MagicSpark, history, 21 month(s) ago, In English

I tried to solve 1153F. I got up with an unusual idea.Then this is my code.I clone the 1153F to a mashup.And I accepted with maximum time 1825 ms.But the time limit is only 1 second. Can some one help me to optimize the code? (Because it is not so slow,I think I don't need to change the algorithm,And I only get this way to solve the problem) [submission:53500731] in the mashup and 53500951 in the contest.

 
 
 
 
  • Vote: I like it
  • -34
  • Vote: I do not like it

»
21 month(s) ago, # |
  Vote: I like it -22 Vote: I do not like it

Auto comment: topic has been updated by MagicSpark (previous revision, new revision, compare).

»
21 month(s) ago, # |
  Vote: I like it -25 Vote: I do not like it

Problem Solved. Thank you for helping.