Page 1 of 2
Server problem on 590 - Maximum execution time exceeded
Posted: Sun Feb 10, 2013 7:07 pm
by Redford
There's a bug in server configuration, I cannot solve 590 lvl. Every time I submit a solution I get:
<br />
<b>Fatal error</b>: Maximum execution time of 30 seconds exceeded in <b>/home/hacker_apache/html/hacker/html/cross/cross.php</b> on line <b>124</b><br />
What can I do? Is there any active admin?
Posted: Sun Feb 10, 2013 9:06 pm
by AMindForeverVoyaging
You can write a mail to:
adum at adum dot com
Posted: Wed May 08, 2013 2:24 pm
by eulerscheZahl
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.
Posted: Wed May 08, 2013 2:45 pm
by Redford
I did about 70 submits, none of them succeeded.
Posted: Thu May 16, 2013 10:36 pm
by Zeta
Please try again. We have a faster solution checker now.
Posted: Fri May 17, 2013 11:37 am
by eulerscheZahl
Thank You!
I couldn't submit my solution for level 634, now it took only 7 seconds to get the next level.
Well done.
Posted: Fri May 17, 2013 12:36 pm
by Redford
Thanks! It works now
Posted: Wed Jun 05, 2013 11:19 am
by Hckr
@Zeta: Very nice. Does that mean, that now the path is open for more levels?
Posted: Thu Jun 06, 2013 10:02 pm
by Zeta
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?
Posted: Fri Jun 07, 2013 12:09 am
by stubbscroll
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!
Posted: Sun Jun 09, 2013 8:20 am
by Hckr
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.
Posted: Sat Jun 15, 2013 11:30 am
by bsguedes
More levels please!
Posted: Mon Oct 20, 2014 9:48 pm
by Hippo
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 ...
Posted: Mon Oct 27, 2014 11:33 am
by Hckr
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
Posted: Tue Oct 28, 2014 4:32 pm
by Hippo
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 ... ).