×

# CSEQ - April15 Long (Time Limit Verification)

 -2 Hi, I would like to know the time constraints about this problem. I have an algorithm which takes O(20*N) time.  where N is ((10power6) + 3). Subtask-3 is getting TLE. Does the solution needs more improvement then that? I'm really exhausted optimizing it. I may have reached the atomic state of optimization. Please let me know the Time constraints in O() notation. @admin: In case, any verification of code needed please see this submission. http://www.codechef.com/viewsolution/6692845 Thanks. asked 07 Apr '15, 13:03 320●1●2●15 accept rate: 0% 0★admin ♦♦ 19.8k●350●498●541

 0 It is against codechef rules to discuss solutions to any problem during an ongoing contest. Also, your solution is not visible to anyone for an ongoing contest. The time-limit is mentioned in the problem, there may be a different approach. :) The editorials will be put up after the contest, you can verify there. Happy Coding! :D answered 07 Apr '15, 13:19 31●2 accept rate: 28% Hi @sanchitkum, I don't want to discuss the actual solution/approach to the problem. The time-limit mentioned is 1 second. I wanted to know in big-O notation. So, like that I can validate it with my algorithm Time-complexity. I know the code won't be visible to any users but however admin may see it. Hence, the tag. :) I'm gonna try to debug further. Thanks. (07 Apr '15, 13:23) 2 Look at the constraints and they say a lot about O()... (07 Apr '15, 23:43)
 toggle preview community wiki:
Preview

By Email:

Markdown Basics

• *italic* or _italic_
• **bold** or __bold__
• image?![alt text](/path/img.jpg "title")
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported
• mathemetical formulas in Latex between \$ symbol

Question tags:

×263
×35

question asked: 07 Apr '15, 13:03

question was seen: 1,963 times

last updated: 13 Apr '15, 15:13