Server problem on 590 - Maximum execution time exceeded

Redford
Posts: 41
Joined: Sat Jul 04, 2009 8:32 pm
Location: Poland
Contact:

Server problem on 590 - Maximum execution time exceeded

Post 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?
Image
AMindForeverVoyaging
Forum Admin
Posts: 496
Joined: Sat May 28, 2011 9:14 am
Location: Germany

Post by AMindForeverVoyaging »

You can write a mail to:
adum at adum dot com
eulerscheZahl
Posts: 58
Joined: Thu Nov 29, 2012 7:45 pm
Location: Germany

Post 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.
Redford
Posts: 41
Joined: Sat Jul 04, 2009 8:32 pm
Location: Poland
Contact:

Post by Redford »

I did about 70 submits, none of them succeeded.
Image
Zeta
Posts: 62
Joined: Thu Apr 16, 2009 3:37 pm

Post by Zeta »

Please try again. We have a faster solution checker now.
eulerscheZahl
Posts: 58
Joined: Thu Nov 29, 2012 7:45 pm
Location: Germany

Post 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.
Redford
Posts: 41
Joined: Sat Jul 04, 2009 8:32 pm
Location: Poland
Contact:

Post by Redford »

Thanks! It works now :)
Image
Hckr
Posts: 27
Joined: Thu Mar 25, 2010 2:16 pm

Post by Hckr »

@Zeta: Very nice. Does that mean, that now the path is open for more levels?
Zeta
Posts: 62
Joined: Thu Apr 16, 2009 3:37 pm

Post 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?
stubbscroll
Posts: 9
Joined: Sat Dec 11, 2010 11:25 pm
Location: NO

Post 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!
Hckr
Posts: 27
Joined: Thu Mar 25, 2010 2:16 pm

Post 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.
User avatar
bsguedes
Posts: 103
Joined: Tue Feb 24, 2009 12:39 am
Location: Porto Alegre

Post by bsguedes »

More levels please! :D
User avatar
Hippo
Posts: 339
Joined: Sat Feb 01, 2014 12:05 am
Location: Praha 5

Post 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 ...
Hckr
Posts: 27
Joined: Thu Mar 25, 2010 2:16 pm

Post 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 :)
User avatar
Hippo
Posts: 339
Joined: Sat Feb 01, 2014 12:05 am
Location: Praha 5

Post 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 ... ).
Post Reply