Server problem on 590 - Maximum execution time exceeded

Redford · Post by **Redford** » Sun Feb 10, 2013 7:07 pm

There's a bug in server configuration, I cannot solve 590 lvl. Every time I submit a solution I get:
 
Fatal error: Maximum execution time of 30 seconds exceeded in /home/hacker_apache/html/hacker/html/cross/cross.php on line 124 
What can I do? Is there any active admin?

Sun Feb 10, 2013 9:06 pm

You can write a mail to:
adum at adum dot com

eulerscheZahl · Post by **eulerscheZahl** » Wed May 08, 2013 2:24 pm

I had the same problem, with alternating line in the error message.
But try number 21 to submit my answer was successful :)
Hopefully next levels won't cause such problems.

Redford · Post by **Redford** » Wed May 08, 2013 2:45 pm

I did about 70 submits, none of them succeeded.

Zeta · Post by **Zeta** » Thu May 16, 2013 10:36 pm

Please try again. We have a faster solution checker now.

eulerscheZahl · Post by **eulerscheZahl** » Fri May 17, 2013 11:37 am

Thank You!
I couldn't submit my solution for level 634, now it took only 7 seconds to get the next level.
Well done.

Redford · Post by **Redford** » Fri May 17, 2013 12:36 pm

Thanks! It works now

Hckr · Post by **Hckr** » Wed Jun 05, 2013 11:19 am

@Zeta: Very nice. Does that mean, that now the path is open for more levels?

Zeta · Post by **Zeta** » Thu Jun 06, 2013 10:02 pm

The solution checker is still written in PHP. I guess the checker would hit the 30 seconds boundary again with an 800x800 board.

Who else is interested in more levels?

stubbscroll · Post by **stubbscroll** » Fri Jun 07, 2013 12:09 am

Zeta wrote:The solution checker is still written in PHP. I guess the checker would hit the 30 seconds boundary again with an 800x800 board. Who else is interested in more levels?

I'm interested. It's always good to have more levels!

Hckr · Post by **Hckr** » Sun Jun 09, 2013 8:20 am

I guess the checker would hit the 30 seconds boundary again with an 800x800 board.

That's more than enough to promote better-than-O(n³) solvers.

bsguedes · Post by **bsguedes** » Sat Jun 15, 2013 11:30 am

More levels please!

Hippo · Post by **Hippo** » Mon Oct 20, 2014 9:48 pm

Hckr wrote:
I guess the checker would hit the 30 seconds boundary again with an 800x800 board.
That's more than enough to promote better-than-O(n³) solvers.

Does anybody have o(n^3) solution?
Reducing multiplicative constant by 128 does not count ...

Hckr · Post by **Hckr** » Mon Oct 27, 2014 11:33 am

Yes there are some. You could see it on the statistical charts, back then, when they were working. On some charts there was a straight line up, meaning that the time between two solved levels was very small, even on the last levels (You could see the chart by clicking on a player level in the score tables. The level scores are still linked but only lead to an empty site).

This inspired me to search this solution and eventually i found it (its even better than O(n²)). Now that you know i hope you also get inspired to search for it

Hippo · Post by **Hippo** » Tue Oct 28, 2014 4:32 pm

Hckr wrote:Yes there are some. You could see it on the statistical charts, back then, when they were working. On some charts there was a straight line up, meaning that the time between two solved levels was very small, even on the last levels (You could see the chart by clicking on a player level in the score tables. The level scores are still linked but only lead to an empty site).

This inspired me to search this solution and eventually i found it (its even better than O(n²)). Now that you know i hope you also get inspired to search for it

Fortunately I neednot to investigate it

... Applying techniques for sparse matrices could probably help a lot (as the initial matrix could be constructed such that most of the rows will contain just 4-5 nonzeros ... ).