Statistics

Problem Statement for "TIEFighterAssembly"

Problem Statement

 
    |-O-|    |-O-|    |-O-|    |-O-|    |-O-|

Above you see a tiny fraction of our glorious imperial fleet, the Twin Ion Engine starfighters (known as "TIE fighters" for short).

Each TIE fighter consists of two solar array wings ('|'), two wing braces ('-') and one central cabin ('O').


Even though our TIE fighters are clearly superior to the X-wing fighters flown by those pesky rebels, occasionally some TIE fighter will receive some accidental combat damage. Whenever a damaged TIE fighter is recovered, we disasemble it and salvage the parts that are still in working condition. It is now up to you to use these salvaged parts to assemble as many complete TIE fighters as possible.


You are given the String salvagedParts. Each character of salvagedParts represents one piece of machinery that has been salvaged. As mentioned above, the characters '|', '-', and 'O' (uppercase oh) represent the parts you need to build a TIE fighter.

There may also be other characters in salvagedParts. These represent machinery that isn't used in a TIE fighter.


Calculate and return the maximum number of TIE fighters you can assemble from the given parts.

Definition

Class:
TIEFighterAssembly
Method:
assemble
Parameters:
String
Returns:
int
Method signature:
int assemble(String salvagedParts)
(be sure your method is public)

Constraints

  • salvagedParts will contain between 1 and 50 characters, inclusive.
  • Each character of salvagedParts will be one of "|-O=+()*" (quotes for clarity).

Examples

  1. "|-O-|"

    Returns: 1

    One fully functional TIE fighter.

  2. "||--O"

    Returns: 1

    The same parts as in the previous example. Again, we can use them to build one TIE fighter.

  3. "|||||-----OOO"

    Returns: 2

    These parts are enough to build two TIE fighters. We will have one '|', one '-' and one 'O' left over.

  4. "=+()*=+()*=+()*"

    Returns: 0

    Useless debris that cannot be used in a TIE fighter.

  5. "||+||-||+||-||+||-||+||-"

    Returns: 0

    We have a lot of solar panels and a lot of wing pylons (and also some '+' that we have no use for). However, we have no central cabins and so we cannot assemble any complete TIE fighters.

  6. "===O|O-O|O-O|O==="

    Returns: 1

    In this example we have the opposite problem: too many cabins but not enough wing parts to use all of them. We can put together just one single TIE fighter. A lot of material will remain unused.

  7. "|"

    Returns: 0

  8. "-"

    Returns: 0

  9. "O"

    Returns: 0

  10. "|--|"

    Returns: 0

  11. "|-O|"

    Returns: 0

  12. "|--O"

    Returns: 0

  13. "--O|-|"

    Returns: 1

  14. "--||||OO|O-O-OO|--|-|O-O|-O"

    Returns: 4

  15. "--||-O||-|--O-O---O|-|-O--OO|"

    Returns: 4

  16. "|--|O-"

    Returns: 1

  17. "|-O---OO|-O-|||-O-|-|--||--||O|-"

    Returns: 6

  18. "O|-O--||-|------||---||-||"

    Returns: 2

  19. "-O|-OO-||O|--"

    Returns: 2

  20. "-O|-|-O--|-||--O|OO|OOO|O|-|-|O-|"

    Returns: 5

  21. "|--O-|---O-||--|-|OO|-"

    Returns: 3

  22. "O-----|-|OO-|-||||O-|-O|---"

    Returns: 4

  23. "O----O|-|--|-|O|-O-|O||-|----|-OO--|--|--OO-|---O|"

    Returns: 7

  24. "||||O-"

    Returns: 0

  25. "--O|O"

    Returns: 0

  26. "|------|-||-"

    Returns: 0

  27. "--|O|O"

    Returns: 1

  28. "|O--O-"

    Returns: 0

  29. "|OO"

    Returns: 0

  30. "-||-|-O|OOO-|"

    Returns: 2

  31. "O-"

    Returns: 0

  32. "-O|O-O-|||-|--||--|O"

    Returns: 4

  33. "||"

    Returns: 0

  34. "---|-OO"

    Returns: 0

  35. "---||-O|O|--O"

    Returns: 2

  36. "||"

    Returns: 0

  37. "||O-|-OO|O|-|-|O--|---||-|O|-||"

    Returns: 5

  38. "|O"

    Returns: 0

  39. "||"

    Returns: 0

  40. "O||"

    Returns: 0

  41. "OO|||-|"

    Returns: 0

  42. "|-|-|-"

    Returns: 0

  43. "+==*=-*)*-O*+-((-+-=*-+"

    Returns: 0

  44. "+O(-|O=|"

    Returns: 0

  45. "||+O"

    Returns: 0

  46. "=||+OOO(*="

    Returns: 0

  47. ")O)-"

    Returns: 0

  48. ")||O"

    Returns: 0

  49. "||O"

    Returns: 0

  50. "*-=)+-)()--)"

    Returns: 0

  51. "(=*|O--))=+)"

    Returns: 0

  52. "|OO-)(==(|=|+|*+O(*-+-)++)+=)=O=(O-|O)(*=(*-*-(*-*"

    Returns: 2

  53. "O|--O-=+*=O-)=)(+|--||(-+--+(=O()=(O*(*(=)**O=|-|+"

    Returns: 3

  54. "-O(*"

    Returns: 0

  55. "-(("

    Returns: 0

  56. "-|*)O|"

    Returns: 0

  57. "O*="

    Returns: 0

  58. "-((+=+=)|OO)(|((--+|"

    Returns: 1

  59. "=(())-O|*O=*-=O*)-==*"

    Returns: 0

  60. "*)(="

    Returns: 0

  61. "O)=**-O"

    Returns: 0

  62. ")((="

    Returns: 0

  63. "==)+"

    Returns: 0

  64. "|=|"

    Returns: 0

  65. "(-O"

    Returns: 0

  66. "*|O"

    Returns: 0

  67. "O*+)**O**=*))-=(-|O+(--*O(O|O(=-+|+*+=(O(="

    Returns: 1

  68. "-+)+*=)"

    Returns: 0

  69. ")OO-"

    Returns: 0

  70. ")((*|O|*((+)|)|OO|O**|O)*)(++)"

    Returns: 0

  71. "O*=="

    Returns: 0

  72. "|O=|)**(|-+**("

    Returns: 0

  73. "--O"

    Returns: 0

  74. "|-+-|"

    Returns: 0

  75. "OO||--"

    Returns: 1

  76. "---OOO***"

    Returns: 0

  77. "|-O-"

    Returns: 0

  78. "||||||--OOOO"

    Returns: 1

  79. "|*O*|"

    Returns: 0

  80. "-------------OOOOOOOOOOO||||||"

    Returns: 3

  81. "||--++"

    Returns: 0

  82. "||||||||||||||||||||||||||--------------O-|"

    Returns: 1

  83. "|||||-----O"

    Returns: 1

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: