OJ Board

Thank you very much Brian - I understand now.

I can follow the sample I/O but I can see more than one algorithm that gives the same output. E.g. "optimistic packet passing/as-soon-as-possible" or "buffering full message re-assembly."

Could someone please explain the output for these test cases:


1 1
1
1 1 1
2 2
1 1
2 1 1
1 1 1
2 4
4 4
1 1 2 ...

You don't need to initialise the PPA value with an arbitrary negative value because the problem states clearly that M > 0 so there will always be an initial edge to initialise from.

It is a nice problem but the description is not the easiest to follow and bit confusing. The term "average" is very ...

I've finally solved this after one wrong answer and a few hours. It is more fiddly than it first looks. I managed rank 62/2333

Some gotchas/hints:

1) Algorithm is graph BFS and with a non-recursive depth track twist. I personally did this with an adjacency list but a matrix should work equally ...