Ladder Bump Race

Replay a dice race on a board with snakes, ladders and bumping, and report where everyone ends up.

The board has squares 0 to N. Every player starts on square 0 (off the board, shared by everyone) and the first to reach square N wins. jumps is a list of [start, end] pairs: a player who finishes a move on start is moved to end (a ladder if end > start, a snake otherwise). A jump is taken once; if end is itself the start of another jump, nothing more happens. end may be 0 or N.

Players 0 .. players-1 take turns in order, and the dice results arrive as the list rolls, each roll used by whoever is playing. A turn works like this:

1. The player moves forward by the roll. If that would pass N, the player bounces back: the new square is N - (position + roll - N).
2. If the new square is the start of a jump, the player takes it.
3. If the player is now on N, they win and the game stops; any remaining rolls are ignored.
4. Otherwise, if the player is on a square from 1 to N - 1 where another player stands, that player is bumped back to square 0. (Square 0 never bumps anyone.)

Sixes: a roll of 6 earns the same player another turn immediately after the move. But if a player would take a third turn in a row because of two consecutive sixes, and the roll is again a 6, that roll is used up without moving the player, and the turn passes to the next player. (A third roll that is not a 6 is played normally.)

If the rolls run out before anyone wins, the game simply ends where it stands.

Input: n, the finishing square N; players, the number of players; jumps, a list of [start, end] pairs with distinct starts; rolls, a list of integers from 1 to 6.

Output: a list of players + 1 integers: each player's final square, in player order, followed by the winner's index, or -1 if nobody won.