OJ Board

-almost well balanced: abs(mindepth(root)-maxdepth(root)) <= 1
-one tree per line
-remeber to output -del in case of delete! (that's what got me AC)

note to judge, I have received rank 1 on this problem.. even though other's have solved it in 0.000 before me... is this do to memory usage that I am ...

I used hashing.. I tried TRIES, they would have been fast if I had been able to use fixed links and not get MLE.

Anyway tho, hashing is fast enough.. and if you get the right hashing function (i.e. one of the more sensible obvious ones), you can avoid key errors while using unsigned int's. Also ...

My program passes all the test cases here (the good ones anyway)

My questions are:

- Do we remove all trailing spaces from the end of a line?
- If the last line in the file does not end with a \n, should a \n be displayed?
- In pascal, this is a valid comment: { *).. not here?
- This sounds ...

SIGILL can be caused by an array out of bounds, i.e. memory containing code is overwritten with garbage and then executed.

You know... I always find it ironic that almost every time I post for help, I then solve in a few minutes later.

(This is one of those times)..

I used a value of EPS around 0.0000001, and doubles... and that gave me the AC (giving away too much? I think EPS should have been stated in the problem ...

I'm also getting WA... However in my tests, our programs produce the same result, with the exception of this test case:

20
0 .5
10 -.5
20 .5
30 -.5
40 .5
50 -.5
60 .5
70 -.5
80 .5
90 -.5
100 .5
110 -.5
120 .5
130 -.5
140 .5
150 -.5
160 .5
170 -.5
180 .5
190 -.5

The only solution too this, is a ...

I have the running theory.. that in the rare(?) case that the greedy algorithm fails, it will only be off by one -- I wonder if there's some way to detect this case quickly and subtract one? hmm...

There you go... I'm working a brute force solution right now... TLE, but I've got it down to just a bit over 20 seconds (on my PC) with 13 test cases of grids of 9x9 X's

[EDIT] Got it down to 4.6 seconds. Thanks, and AC

Again, same.

My program also outputs 2 for that case.

(Oops... last time I was here there wasn't a post, ah well... might as well delete my old one)

I'm getting WA.. can someone explain why my algorithm won't work?

It is..

minQueens = 0
While boardNotEmpty:
PlaceQueenWhichEliminatesLargestNumberOfX's
EliminateX'sForThatQueen
minQueens ++
Loop ...

After a little bit of a headache, and a few *cough* submissions, I solved it in 0.031 -- With a GA (that's Genetic Algorithm)

I used to obsessed with GA's... when all else failed, I would write a GA... let's hope this doesn't cause a relapse, lol

I did the exact same thing, and then got AC -- If not directly a bug in the judges output, it must have been a bug or "nuance" in the library used with the code to produce that output.

I recently solved 10023 (sqrt) using a method described in the forms, and my bigInt class used base 10 digits, in a time of about 5 seconds -- It's seems pretty obvious too me, that if I had used a higher base (i.e. base 10^9) -- it would have greatly increased the speed of addition and subtraction ...

I understand, thanks.