ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1018. Binary Apple Tree

Show all messages Hide all messages

About TLE and Recursion † Ленин † [Yaroslavl SU] 22 Mar 2010 16:00
I got TL#6.

After that just a little bit updated my solution:

int max( int pos, int len )
{
..if ( ch[pos][len] )
....return dp[pos][len];
---
....ch[pos][len] = 1;
....dp[pos][len] = res;
....return res;
---
}

and got AC in 0.015s.

Edited by author 23.03.2010 20:30
Re: About TLE and Recursion dango3334 18 Dec 2010 17:17
I get TLE in #6 too , can you explain in detail?
Re: About TLE and Recursion WXYJason 3 Jun 2013 19:00
Well, I checked my solution and it didn't seem that could exceed the time limit... Weird... I've got TLE #6 too.
Re: About TLE and Recursion Aoki 23 Feb 2018 06:41
Can you explain in detail??I'm afraid i can't understand.....
Re: About TLE and Recursion Aoki 23 Feb 2018 06:45
oh,now I get AC.Just a little mistakes.