OJ Board

The problem statement says nothing of the sort, but you seem to know what you're doing so ok thanks.

How could that be the answer? There's no train at C at time 0622. (0622 isn't in the input times at all)
My output is

Oh I didn't see the part that says the list is from top to bottom - I thought it was bottom to top.
Thanks, got accepted now

This problem makes no sense. I was testing random cases with the UVA toolkit, and I learned that it's wrong to assume that Jill can't go back in time.
For this case

1
10
A
B
C
D
E
F
G
H
I
J
5
6
0072 B
1233 E
1975 F
0531 G
1223 I
0494 J
3
0661 B
1477 I
1602 J
4
1034 F
0567 G
1618 I
1218 J
8
0582 C ...

Is it just me, or is this problem statement more than a little contradictory?
It says "Print a blank line between two successive test cases" but the sample output doesn't have any blank lines.
It also says that we should print the identification string of the top face, but the sample output shows ...

What should the output be for this case? The UVa toolkit gives
1 2 5 7 17 0 21 2 23 6 24 10 30 0
But shouldn't it be
1 2 5 7 17 0 21 2 23 6 24 10 30 6 32 0
?

I've been testing my solution with the UVa toolkit, and I found a couple cases that I don't understand.
1) 2H 3H TH 5H KH 3D JD KD 2D 2D
Output is "Black wins." Shouldn't it be white? Both are flushes, the highest card is a king, then white has a higher second-highest card (jack vs ten).
2) 8C 9C ...

I’m surprised no one’s asked about the number of test cases in the input file, so I’ll be the first. The problem statement just says “there may be any number of games in the input data”, which is really unfair because it doesn’t give any sense of how fast a solution needs to be. Any number could be ...