OJ Board

I had also problems with this problem.
In fact, there is a bug in the problem specification (or in tests). There is a test case where d == 0. Try assert (d>=1). For this case the answer should be s-1.

I am also curiuos about that. But, i think, your calculations are not realistic. You have to add the compilation time and the fact, that in the first 2 hours the system was quite idle.

I've noticed that many programs have been running at the same time. I wonder if simple FIFO algorithm could be ...

I also think that you and the whole team make really good job!
But large participation in the last contest (Warmup 1) caused some troubles with the testing system (400 submission waiting in the queue).
Will it be fixed in the next contest?

thanks. i have already got Acc. It was confusing for me whether use information form all BIRTH and DEATH commands from input or take only those which are before the command.
Thanks, anyway

Hi
What's the output for:

BIRTH John Doe : January 7, 1599: Adam Doe : Jane Doe
BIRTH Casper Ghost : Jan 2, 1959 : Mary Worth : John Doe
ANCESTORS Casper Ghost
BIRTH Mary Worth : May 18, 1666:Jane Doe : Adam Doe
DEATH Mary Worth : Jan 3, 1959
DESCENDANTS John Doe
QUIT


I can not solve this ...

miras wrote:ello
your output is OK!!!!!!!!!!!

thanks. I already know where I have a bug . Stupid and hard to find bug, i must say. But, thanks, anyway

Could somebody give me carrect output for this input? I am really mad about this problem. What's the trick?

4 1
1 1 2 2
2

5 2
1 2 3 4 5
2 1

4 1
1 2 3 4
2

1 0
1

5 2
1 2 2 2 5
0 1

50 50
1 2 2 2 2 2 2 3 3 3 4 2 1 2 3 4 5 6 7 9 50 1 2 3 4 2 1 2 3 2 2 5 9 8 5 4 3 2 9 49 29 24 2 2 6 9 9 9 9 9
1 2 ...

Is it possible to get O(nlogn) for this problem? I got acc but my program runs extreamly slow (nearly 5sec) and I have only O(n^2). I would be grateful for any hint

Is it possible to receive all messages from chosen forum(s) on email?
Is it possible to send messages by email instead of using this website?
If yes, how to do it?

cauchy