OJ Board

ptargino wrote:The test cases of this problems are wrong. Actually, you just need to verify if each substring is prefix of the original. I've done this way and got AC.

I can confirm this. Dont bother with KMP, suffix tree or whatsoever.

Anybody now has the idea how transitivity works?
I got AC using david's method, but I really want a proof of that.

With the new judge server, I tried my old code (<30 lines) and it gets accepted in 2.2s. So it is possible to use STL map to get AC now, using the way described by Larry (3 years ago). Remember to use gets to read input, using cin will cause TLE. It feels so good to solve a problem after 3.5 years! ...

To everybody who got stuck, it is necessary to check whether you calculated v is larger than or equal to m.

if (v<m)
cout<<"Not found\n";
else
cout<<v<<endl;

The inputs to this problem is actually very easy to solve LOL

Can anybody offer some hint?

How do you do manual hashing?
I also get WA by using STL. Seems like STL hash table is not working too well, not as good as Java's hash table.

There is only 1 test case in this problem. 10 400 30 410 30 420 30 430 30 430 40 430 50 430 60 400 50 425 34 428 40 20 38 26 24 23 31 15 25 3 2 11 35 28 46 48 30 32 7 47 44 41 9 17 32 34 1 23 7 38 28 39 14 3 26 16 31 38 41 7 18 6 42 373 391 398 243 399 205 372 296 377 254 377 382 395 214 379 186 375...

Spykaj wrote:Colors ? =) I like red, green, blue xD haha =)

Submitted in last 48 hours - red
Submitted in last week - green
Submitted in last month - blue
Else black

For example

How about allowing us to set the colors on our own? That will be awesome.

removed

Hmm. Well my version of gcc compiles and runs atof() with doubles, but produces some weird results if I don't include <stdlib.h>. If I do, everything is ok. But maybe some C-guru (mf, krzysztof, misof) can explain that. On my computer it works well without including cstdlib, but I'm getting WA on t...

There is no input with xi<=0, but there is Xi with value 999.
Beware.

To all people who are getting TLE, there is an algorithm posted on Methods to Solve website. It takes 0.5s to run.

http://www.comp.nus.edu.sg/~stevenha/pr ... y%20Syntax

deleted

Anybody knows a more efficient way to do this?
My code gets AC in 9.97s ....