OJ Board

The summary: C: It seems it has incorrect constraints. I checked (but too late) n, at it is not in [2,100]. D: A mistake in the problem statement. But there was a clarification E: An incorrect output checker. Accepts any output. G: There should be not such problems, while the judge is very slow. And...

2hewei Actually, I used dynamic programming. The running time is O(N^4) (however the inner loop contains a few operations, so the constant is small and there is no TL), and the used memory is O(N^3) (at first I had array int [210][210][210] and that caused ML - it was quite annoying). If you want mo...

Could something be done with the system so that it would process submissions faster? It is very annoying. The overloaded system destroys the pleasure from very good problem sets. For example, during the last contest I submitted the problem A in hour before the end, and received the answer "Memo...

Oh, I wrote incorrectly in my last post, but my first post is correct. You should read as "ignoring <=1" instead of "ignoring <=5" and "ignoring <=75" instead of "ignoring <=76". So, in your last example: f1(0) = 4 f2(4) = 1 f1(1) = 5 f2(5) = 3 f1(3) = 7 f2(7)...

You did only the first step. For the next step you should search the lowest maximum speed you can use (ignoring pathes with speed <=5). It will be 76. Then the maximum minimum speed (ignoring pathes with speed >76) will be 75. Calculate the answer for [75,76] (it is better than for [1,5]) and update...

Not E is too dificult but other problems are much smaller to code.

This year is for Europe, moreover - for East Europe (4 top teams and 6 from 10 are from here). Before contest I gambled on Warsaw and Moscow, and I was right. They are really the best (specially Warsaw). Problems this year was much more easier, it was really possible to solve 8-9 problems (to protec...

Does anybody have self-made solutions and test data for ACM Finals 1998, 2000-2002 (specialy 2002)? I'd like to exchange them, because it seems that official solutions and tests don't exist.

Your factors are correct up to 16 digits after dot. But did you notice that input is area of triangle (or volume with height 1), not the length of its side? I did this mistake at first. I'm very upset about this problem. It is clear that problem description was made to confuse people. I've solved a ...

I'm going too. See you all in Beverly Hills .

Yes, that was the reason. But why at the end should be two blank lines? It seems incorrect, because problem statement says that 0 should not be processed. Does the problem also require rejudgement ?

What should I output to not receive PE?

BTW, do you mean a1+1 by the next-larger edge speed, or simply 6+1 = 7? For real numbers it will be the next speed, but for integers you can use a1+1 as threshold for speed ignoring. Or f1 can be modificated so it ignores speeds that are lower or equal to a1. There are at most E steps (usually much...

When you go from 0 to 2 on rickshaw, you don't let him go at 1. So you go all 12km with him, wait him and pay only once.

Problem is good but I come with my solution enough quickly and for now it is on the first place (I think not for long). At first I wrote 2 similar functions. The first ignores roads with speed lower than X and searches minimal speed Y so you can go from the start to the end by roads in [X,Y] (f1(x)=...