| Author |
Message |
Redford
Joined: 04 Jul 2009
Posts: 41
Location: Poland |
|
 Server problem on 590 - Maximum execution time exceeded |
 |
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?
_________________
 |
|
| Sun Feb 10, 2013 7:07 pm |
   |
 |
AMindForeverVoyaging
Forum Admin
Joined: 28 May 2011
Posts: 489
Location: Germany |
|
| |
|
You can write a mail to:
adum at adum dot com
|
|
| Sun Feb 10, 2013 9:06 pm |
|
|
eulerscheZahl
Joined: 29 Nov 2012
Posts: 57
Location: Germany |
|
| |
|
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.
|
|
| Wed May 08, 2013 2:24 pm |
|
|
Redford
Joined: 04 Jul 2009
Posts: 41
Location: Poland |
|
| |
|
I did about 70 submits, none of them succeeded.
_________________
|
|
| Wed May 08, 2013 2:45 pm |
|
|
Zeta
Joined: 16 Apr 2009
Posts: 62
|
|
| |
|
Please try again. We have a faster solution checker now.
|
|
| Thu May 16, 2013 10:36 pm |
|
|
eulerscheZahl
Joined: 29 Nov 2012
Posts: 57
Location: Germany |
|
| |
|
Thank You!
I couldn't submit my solution for level 634, now it took only 7 seconds to get the next level.
Well done.
|
|
| Fri May 17, 2013 11:37 am |
|
|
Redford
Joined: 04 Jul 2009
Posts: 41
Location: Poland |
|
| |
|
Thanks! It works now 
_________________
|
|
| Fri May 17, 2013 12:36 pm |
|
|
Hckr
Joined: 25 Mar 2010
Posts: 27
|
|
| |
|
@Zeta: Very nice. Does that mean, that now the path is open for more levels?
|
|
| Wed Jun 05, 2013 11:19 am |
|
|
Zeta
Joined: 16 Apr 2009
Posts: 62
|
|
| |
|
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?
|
|
| Thu Jun 06, 2013 10:02 pm |
|
|
stubbscroll
Joined: 11 Dec 2010
Posts: 9
Location: NO |
|
| |
|
 |
|
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!
|
|
| Fri Jun 07, 2013 12:09 am |
|
|
Hckr
Joined: 25 Mar 2010
Posts: 27
|
|
| |
|
|
|
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.
|
|
| Sun Jun 09, 2013 8:20 am |
|
|
bsguedes
Joined: 24 Feb 2009
Posts: 103
Location: Porto Alegre |
|
|
| Sat Jun 15, 2013 11:30 am |
|
|
Hippo
Joined: 01 Feb 2014
Posts: 339
Location: Praha 5 |
|
| |
|
|
|
|
|
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 ...
|
|
| Mon Oct 20, 2014 9:48 pm |
|
|
Hckr
Joined: 25 Mar 2010
Posts: 27
|
|
| |
|
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
|
|
| Mon Oct 27, 2014 11:33 am |
|
|
Hippo
Joined: 01 Feb 2014
Posts: 339
Location: Praha 5 |
|
| |
|
|
|
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 ... ).
|
|
| Tue Oct 28, 2014 4:32 pm |
|
|
|
