Statistics

Problem Statement for "Animation"

Problem Statement

A collection of particles is contained in a linear chamber. They all have the same speed, but some are headed toward the right and others are headed toward the left. These particles can pass through each other without disturbing the motion of the particles, so all the particles will leave the chamber relatively quickly.

We will be given the initial conditions by a String init containing at each position an 'L' for a leftward moving particle, an 'R' for a rightward moving particle, or a '.' for an empty location. init shows all the positions in the chamber. Initially, no location in the chamber contains two particles passing through each other.

We would like an animation of the process. At each unit of time, we want a string showing occupied locations with an 'X' and unoccupied locations with a '.'. Create a class Animation that contains a method animate that is given an int speed and a String init giving the initial conditions. The speed is the number of positions each particle moves in one time unit.

The method will return a String[] in which each successive element shows the occupied locations at the next time unit. The first element of the return should show the occupied locations at the initial instant (at time = 0) in the 'X','.' format. The last element in the return should show the empty chamber at the first time that it becomes empty.

Definition

Class:
Animation
Method:
animate
Parameters:
int, String
Returns:
String[]
Method signature:
String[] animate(int speed, String init)
(be sure your method is public)

Constraints

  • speed will be between 1 and 10 inclusive
  • init will contain between 1 and 50 characters inclusive
  • each character in init will be '.' or 'L' or 'R'

Examples

  1. 2

    "..R...."

    Returns: { "..X....", "....X..", "......X", "......." }

    The single particle starts at the 3rd position, moves to the 5th, then 7th, and then out of the chamber.

  2. 3

    "RR..LRL"

    Returns: { "XX..XXX", ".X.XX..", "X.....X", "......." }

    At time 1, there are actually 4 particles in the chamber, but two are passing through each other at the 4th position

  3. 2

    "LRLR.LRLR"

    Returns: { "XXXX.XXXX", "X..X.X..X", ".X.X.X.X.", ".X.....X.", "........." }

    At time 0 there are 8 particles. At time 1, there are still 6 particles, but only 4 positions are occupied since particles are passing through each other.

  4. 10

    "RLRLRLRLRL"

    Returns: { "XXXXXXXXXX", ".........." }

    These particles are moving so fast that they all exit the chamber by time 1.

  5. 1

    "..."

    Returns: { "..." }

  6. 8

    ".........."

    Returns: { ".........." }

  7. 1

    "RRRRRRRRRRRRRRRRRRRR"

    Returns: { "XXXXXXXXXXXXXXXXXXXX", ".XXXXXXXXXXXXXXXXXXX", "..XXXXXXXXXXXXXXXXXX", "...XXXXXXXXXXXXXXXXX", "....XXXXXXXXXXXXXXXX", ".....XXXXXXXXXXXXXXX", "......XXXXXXXXXXXXXX", ".......XXXXXXXXXXXXX", "........XXXXXXXXXXXX", ".........XXXXXXXXXXX", "..........XXXXXXXXXX", "...........XXXXXXXXX", "............XXXXXXXX", ".............XXXXXXX", "..............XXXXXX", "...............XXXXX", "................XXXX", ".................XXX", "..................XX", "...................X", "...................." }

  8. 2

    "LR.LR.LR.LR.L"

    Returns: { "XX.XX.XX.XX.X", ".X.XX.XX.XX.X", "..X..X..X..X.", "X..X..XX..X..", ".X..X....X..X", "..X........X.", "X............", "............." }

  9. 1

    "LR.LR.LR.LR.L"

    Returns: { "XX.XX.XX.XX.X", "..X..X..X..X.", ".X.XX.XX.XX.X", "X..XX.XX.XX..", "..X..X..X..X.", ".X..X.XX.X..X", "X..X..XX..X..", "..X..X..X..X.", ".X..X....X..X", "X..X......X..", "..X........X.", ".X..........X", "X............", "............." }

  10. 3

    "LR.LR.LR.LR.L"

    Returns: { "XX.XX.XX.XX.X", "X..XX.XX.XX..", "X..X..XX..X..", "X..X......X..", "X............", "............." }

  11. 4

    "LR.LR.LR.LR.L"

    Returns: { "XX.XX.XX.XX.X", "..X..X..X..X.", ".X..X....X..X", "X............", "............." }

  12. 5

    "LR.LR.LR.LR.L"

    Returns: { "XX.XX.XX.XX.X", ".X..X.XX.X..X", "..X........X.", "............." }

  13. 10

    "LR.LR.LR.LR.L"

    Returns: { "XX.XX.XX.XX.X", "..X........X.", "............." }

  14. 1

    "RRRLLL..."

    Returns: { "XXXXXX...", ".XXXX....", ".XXXX....", "XXXXXX...", "XX..XXX..", "X....XXX.", "......XXX", ".......XX", "........X", "........." }

  15. 2

    "RRRLLL..."

    Returns: { "XXXXXX...", ".XXXX....", "XX..XXX..", "......XXX", "........X", "........." }

  16. 2

    ".................................................."

    Returns: { ".................................................." }

  17. 1

    "................................................R."

    Returns: { "................................................X.", ".................................................X", ".................................................." }

  18. 3

    "LRRL.LR.LRR.R.LRRL."

    Returns: { "XXXX.XX.XXX.X.XXXX.", "X.X.XX...X.XXXXX..X", "..X....XX..XX..XX.X", ".....X..X.XX...X..X", "..X..X.......XX...X", "..X.............XX.", "..................." }

  19. 6

    "LRRL.LR.LRR.R.LRRL."

    Returns: { "XXXX.XX.XXX.X.XXXX.", "..X....XX..XX..XX.X", "..X..X.......XX...X", "..................." }

  20. 7

    "LRRL.LR.LRR.R.LRRL."

    Returns: { "XXXX.XX.XXX.X.XXXX.", ".X.....XXXX..X..XX.", "X..X...........XX..", "..................." }

  21. 1

    "LRRL.LR.LRR.R.LRRL."

    Returns: { "XXXX.XX.XXX.X.XXXX.", "..XXX..X..XX.X..XX.", ".X.XX.X.X..XX.XX.XX", "X.X.XX...X.XXXXX..X", ".X..XXX...X..XX.X..", "X..X..XX.X.XX.XX.X.", "..X....XX..XX..XX.X", ".X.....XXXX..X..XX.", "X.....X..XX...X..XX", ".....X..X.XX...X..X", "....X..X...XX...X..", "...X..X.....XX...X.", "..X..X.......XX...X", ".X..X.........XX...", "X..X...........XX..", "..X.............XX.", ".X...............XX", "X.................X", "..................." }

  22. 1

    "R.L"

    Returns: { "X.X", ".X.", "X.X", "..." }

  23. 1

    "LRRL.LR.LRR.R.LRRL."

    Returns: { "XXXX.XX.XXX.X.XXXX.", "..XXX..X..XX.X..XX.", ".X.XX.X.X..XX.XX.XX", "X.X.XX...X.XXXXX..X", ".X..XXX...X..XX.X..", "X..X..XX.X.XX.XX.X.", "..X....XX..XX..XX.X", ".X.....XXXX..X..XX.", "X.....X..XX...X..XX", ".....X..X.XX...X..X", "....X..X...XX...X..", "...X..X.....XX...X.", "..X..X.......XX...X", ".X..X.........XX...", "X..X...........XX..", "..X.............XX.", ".X...............XX", "X.................X", "..................." }

  24. 1

    "..."

    Returns: { "..." }

  25. 5

    "LR"

    Returns: { "XX", ".." }

  26. 1

    "RRLL..RRLL"

    Returns: { "XXXX..XXXX", ".XX....XX.", "XXXX..XXXX", "X..XXXX..X", "....XX....", "...XXXX...", "..XX..XX..", ".XX....XX.", "XX......XX", "X........X", ".........." }

This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2024, TopCoder, Inc. All rights reserved.
This problem was used for: