AE3A - Drilling

no tags 


hide comments
yellow_fellow: 2019-04-16 09:23:00

such fun, much interesting problem

Daga: 2014-08-17 19:55:50

Can anyone explain the problem

Atul Vaibhav: 2013-07-20 07:45:56

getting WA!
whats the output for:
20
12 65 98 7 4 21 35 15 98 26 45 32 84 25 2 65 12 20 39 87

Lox: 2009-08-17 06:36:46

The time limit is so strict that it's hard to optimize an O(N^2) approach and I had to use an O(N^3) approach with weird optimization :(

Alfonso2 Peterssen: 2009-06-07 21:17:54

I have an O(n^3) worst case(optimized of course), but it is as fast as an O(n^2).
Time limit too strict...

nik: 2009-06-04 11:17:54

Problem statement isn't complete. Poor translation.

Mark Gordon: 2009-06-04 05:18:54

Maybe the time limit is too strict? I have a fairly reasonable O(N^2) solution that is timing out.

Whew, finally got it accepted. However I still feel like the time limit is pretty mean.

Last edit: 2009-06-04 05:41:00

Added by:Race with time
Date:2009-05-03
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:Algorithmic Engagements 2009