Statistics

Problem Statement for "ColorfulRoad"

Problem Statement

There is a one-dimensional road. The road is separated into N consecutive parts. The parts are numbered 0 through N-1, in order. Ciel is going to walk from part 0 to part N-1.

Ciel also noticed that each part of the road has a color: either red, green, or blue. Part 0 is red.

Ciel is going to perform a sequence of steps. Each step must lead in the positive direction. That is, if her current part is i, the next step will take her to one of the parts i+1 through N-1, inclusive. Her steps can be arbitrarily long. However, longer steps are harder: a step of length j costs j*j energy.

Additionally, Ciel wants to step on colors in a specific order: red, green, blue, red, green, blue, ... That is, she starts on the red part 0, makes a step to a green part, from there to a blue part, and so on, always repeating red, green, and blue in a cycle. Note that the final part N-1 also has some color and thus Ciel must reach it in a corresponding step.

You are given a String road containing N elements. For each i, element i of road is the color of part i: 'R' represents red, 'G' green, and 'B' blue. If Ciel can reach part N-1 in the way described above, return the smallest possible total cost of doing so. Otherwise, return -1.

Definition

Class:
ColorfulRoad
Method:
getMin
Parameters:
String
Returns:
int
Method signature:
int getMin(String road)
(be sure your method is public)

Constraints

  • road will contain between 2 and 15 characters, inclusive.
  • Each character of road will be either 'R' or 'G' or 'B'.
  • The first character of road will be 'R'.

Examples

  1. "RGGGB"

    Returns: 8

    The optimum solution is to step part 0 -> part 2 -> part 4. The total cost is 2*2 + 2*2 = 8.

  2. "RGBRGBRGB"

    Returns: 8

    The optimum solution is to make steps of length 1. It costs 1*1 = 1 per each step, so the total cost is 8.

  3. "RBBGGGRR"

    Returns: -1

    It is impossible to reach the destination.

  4. "RBRRBGGGBBBBR"

    Returns: 50

  5. "RG"

    Returns: 1

  6. "RBRGBGBGGBGRGGG"

    Returns: 52

  7. "RB"

    Returns: -1

  8. "RR"

    Returns: -1

  9. "RBRBRBRBRBRBRBG"

    Returns: 196

  10. "RGRGRGRGRGRGRGR"

    Returns: -1

  11. "RBRBRBRBRGRGRGR"

    Returns: -1

  12. "RRRRRRRRRRRRRRR"

    Returns: -1

  13. "RGGGGGGGGGGGGGR"

    Returns: -1

  14. "RBBBBBBBBBBBBBR"

    Returns: -1

  15. "RGGGBBRRRRGGBBR"

    Returns: 34

  16. "RGGBBRRGGBBRRG"

    Returns: 25

  17. "RGGGBBBRRRGGGB"

    Returns: 35

  18. "RGGGGBBBBRRRRG"

    Returns: 43

  19. "RGGGGGBBBBBRRRG"

    Returns: 50

  20. "RG"

    Returns: 1

  21. "RRB"

    Returns: -1

  22. "RGBR"

    Returns: 3

  23. "RGRBG"

    Returns: 16

  24. "RGBRRG"

    Returns: 7

  25. "RRBRBGG"

    Returns: 36

  26. "RRGBGRRR"

    Returns: 21

  27. "RGBGBRRRB"

    Returns: 34

  28. "RRGGGBBGGR"

    Returns: 27

  29. "RBGGGRGRRGB"

    Returns: 52

  30. "RBRGBRBGBGBG"

    Returns: 47

  31. "RGBGBBRGBBBBG"

    Returns: 50

  32. "RRGRGRGGRRRRBR"

    Returns: 73

  33. "RGGBGBGBRBRGBGG"

    Returns: 50

  34. "RRBRB"

    Returns: -1

  35. "RRRBR"

    Returns: -1

  36. "RGBGG"

    Returns: 16

  37. "RBBBB"

    Returns: -1

  38. "RRRRB"

    Returns: -1

  39. "RBBGBBGGGGRGRGG"

    Returns: 54

  40. "RRRRRGBGRBRBRRG"

    Returns: 54

  41. "RBRRBRRGRRGGBGR"

    Returns: 78

  42. "RRGBRGRGRRBBBBR"

    Returns: 40

  43. "RGBGRGRGRGRGRBR"

    Returns: 44

  44. "RGGBR"

    Returns: 6

  45. "RGBBBR"

    Returns: 9

  46. "RRRGBBR"

    Returns: 14

  47. "RRRGGBBR"

    Returns: 17

  48. "RRRRRRRRRRRRRG"

    Returns: 169

  49. "RRRRRRRRGGGGGB"

    Returns: 89

  50. "RRGGGGGGGGBBR"

    Returns: 54

  51. "RGGGGGGGGGBRG"

    Returns: 52

  52. "RRRRRRRRRRRRRRG"

    Returns: 196

  53. "RGGGGGGGGGGGGGB"

    Returns: 98

  54. "RGGGGGGGBBBBBBR"

    Returns: 66

  55. "RRRGGGGBRRRRRRG"

    Returns: 50

  56. "RRRRGGGBBBBBRGB"

    Returns: 50

  57. "RRRRGBBBBBRRGBR"

    Returns: 40

  58. "RRRRRGBBBBRGBRG"

    Returns: 42

  59. "RGBRRRRGGGGBRGB"

    Returns: 32

  60. "RGBBRGBBBRGGGBR"

    Returns: 24

  61. "RGBRGGGBBRRGBRG"

    Returns: 22

  62. "RGBBRGBBRGGBRGB"

    Returns: 20

  63. "RGBRGBRGBBRGBBR"

    Returns: 18

  64. "RRGBRGBRGBRGBRG"

    Returns: 16

  65. "RGBRGBRGBRGBRGB"

    Returns: 14

  66. "RRRRRRGGGGGBRRG"

    Returns: 66

  67. "RRRRGGBBBBBBRRG"

    Returns: 52

  68. "RGGGGGGGGBRRRRG"

    Returns: 54

  69. "RRRRRRRRRRGBRRG"

    Returns: 106

  70. "RGGGGBBBBRGGGGB"

    Returns: 40

  71. "RRRRGBBBBBRGGGB"

    Returns: 42

  72. "RRRGGGGBBRRRRGB"

    Returns: 44

  73. "RGGGBBBRRRRRRGB"

    Returns: 44

  74. "RGGBBBBBRGGGBBR"

    Returns: 34

  75. "RRRRGBBRRRRGBBR"

    Returns: 38

  76. "RGBBRRRRRRRRGBR"

    Returns: 48

  77. "RGGGBBRRRRRGGBR"

    Returns: 36

  78. "RRRRRRRRRRRRRRR"

    Returns: -1

  79. "RGBRGBRGBRGB"

    Returns: 11

  80. "RGGRB"

    Returns: 8

  81. "RGBGRR"

    Returns: 11

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: