OJ Board

roticv wrote:I finally realised that there is a linear solution to the problem - solving longest path on a DAG.

That's what I did too. The only problem is that building the graph is not linear time, I believe. Still, it was fast enough to get it accepted in 0.012s.

Have you actually check the sample input/output? You code produces

Minimun Number of Trips = 4

when it should be

Minimun Number of Trips = 5

Anyways, your error is in the line with the division and ceiling in the output. 99/24 = 4 since it is an integer division, so ceiling is useless.

I honestly do not know what's wrong with my code. I used the square and double method, which worked perfectly well on 474, and is failing hard here. Eventually I took the suggestion of using BigInt, and got it accepted. I still have no idea what's wrong though, since both code gives the same output ...

I don't think so. My AC code outputs 2^-6 = 1.563e-2.

I hate print blank line between test case so much. Judge will say WA instead of PE, which leads you to a wild goose chase.

On this case:
1
9 9 9 9
0 0 0 0
1
9 9 9 9

The code I just submitted and got AC with returns -1, if you'd rather believe your WA code and UVAtoolkit's 4 that's up to you, let us know if you can get AC with that logic. Others in this thread that have got AC agreed that it should be -1.
My AC code ...