Discussion @ 1018. Binary Apple Tree @ Timus Online Judge

About TLE and Recursion

Posted by † Ленин † [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

Posted by dango3334 18 Dec 2010 17:17

I get TLE in #6 too , can you explain in detail？

Re: About TLE and Recursion

Posted by 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

Posted by Aoki 23 Feb 2018 06:41

Can you explain in detail??I'm afraid i can't understand.....

Re: About TLE and Recursion

Posted by Aoki 23 Feb 2018 06:45

oh,now I get AC.Just a little mistakes.

Discussion of Problem 1018. Binary Apple Tree