It seems as of recent, there have been a lot a Jimmys falling to their death, as can be seen here, and here where you were asked to determine if Jimmy would fall. It is time we put a stop to this madness and try to save Jimmy.

Jimmy has three body parts /, o, and arranged like this

/o

Platforms are represented with -. Jimmy will fall off their platform iff they have two or more body parts that are not directly above a platform.

Some examples:

 /o
- -------

Jimmy will balance since all their body parts are above a -.

 /o
 ------ ---

Jimmy will balanced since two body parts are above -s.

 /o
-- ---- --

Jimmy will balance even though they are split between two platforms

 /o
 -

Jimmy will not balanced since two body parts are not above a platform.

Since my platform supply is running low, I only have platforms with a length of 5, and it is important we use as few as possible.

Your task is to take an input of Jimmys and output a string of platforms which will save all of the Jimmys in the input. Your output must use as few platforms as possible, but each platform must be 5 -'s wide.

Note that the rule of the platform being 5 - wide, means that each platform must have a space between them. ---------- is not valid in the output since it will be considered a platform of length 10 and not two platforms of length 5.

Test Case's

/o /o/o // input
----- ----- // output

/o /o
----- -----

/o /o // same input as above
----- ----- // this is also valid output

 /o /o
 -----

Standard rules apply.

This is code-golf, may the shortest answer win!

Python 2, 72 71 70 bytes

lambda s:S('/',' ',S("[^/ ].5","----- ",s+' '*5))
import re;S=re.sub

Try it online!

Not the prettiest, not sure how to better handle those leftover slashes...

Python 3, 158 164 160 bytes

a=input();r=""
for i,c in enumerate(a):
 try:r[i]
 except:
 if c in"/o":
 r+=(a[i+5<len(a)and i+5or len(a)-1]=="o"and" "or"")+"----- "
 else:r+=" "
print(r)

Try it online!

This is my first code golf answer, and I'm happy it's on a Jimmy question!

Explanation:

• a=input();r="": Take in input and initialize a new string r.




• for i,c in enumerate(a):: Enumerate over the input.




• try:r[i] ... except:: See if r[i] exists - if not, process the except block.




• if c in"/o":: Check if the current character is in Jimmy's first two body parts.




• r+=(a[i+5<len(a)and i+5or len(a)-1]=="o"and" "or"")+"----- ": If so, add a new segment. Add a space before our new segment if another Jimmy head is present in five characters.




• else:r+=" ": Otherwise, just add a space.




• print(r): Print our final result.

JavaScript (ES6), 56 bytes

s=>[...s+1e4].map(c=>(+s?--s:c>?s=5:0)?'-':' ').join``

Try it online!

Or 49 bytes if returning an array of characters is acceptable.