OJ Board

I used two priority queue however it was a WA
but the algorithm seems to be ok, i'm still working on it

( WA in 2.2sec )

here's a few io :


1 2 3 4 5
1 2 3 4 5
1 2 3 4 5
1 2 3 4 5
1 2 3 4 5
1 2 3 4 5
1 2 3 4 5
1 2 3 4 5
1 2 3 4 5
1 2 3 4 5
1 2 3 4 5
1 2 3 4 5
1 2 3 4 5
1 1 1 1 1
6 6 6 6 6
6 6 6 1 1
1 1 1 2 2
1 1 1 2 3
1 2 3 4 5
1 2 3 4 6
6 1 2 6 6
1 4 5 5 5
5 5 5 5 6
4 4 4 5 6
3 1 3 6 3
2 2 2 4 6
4 4 4 4 4
2 2 3 6 6 ...

it's a full house!

I used hill climbing with random restart

but i had to test the maximum up to 30 times to ensure correct result

p.s what's "randomize()" equivalence in gcc?!!!

Emilio wrote:No, you will have n elements O((n)log(n)).
Exactly n-m+1 elements.
Each element can be of m as lenght, or you can solve it with only an array of chars and another array of char pointers.

you're absolutely right

my mistake!

what's the correct output for this :

well with a qsort you will have m*n element which results in O((mn)log(mn))

n = string lenght
m = password lenght

my o(n) solution using stacks exceeds the time limit,
is there any faster aproach or there is something wrong about my code?

Timo wrote: I think your implementation of Hashtable is wrong.
I have use Hashtable too.. and it give me AC

I used Rabin Karp method for hashing but it gave me a WA
what is your method?

oops
thanx!

I don't know what's wrong with my code,
seems it's bigger than a precision problem
any sugestions?

There is function called next_permutation() at the STL library algorithm.h
You can use that. It is just a two line program.

what's the point?