Robotti

import bisect

# Read input
num_rooms = int(input())
layout = input()

# Initialize variables
total_steps = 0
total_coins = 0

# Locate initial positions
if layout:
    robot_pos = layout.index("R")

# Find all star positions
star_positions = [i for i, x in enumerate(layout) if x == "*"]

# While there are stars remaining
while star_positions:
    # Use binary search to find the closest star
    pos = bisect.bisect_left(star_positions, robot_pos)

    if pos == 0:
        closest_star = star_positions[0]
    elif pos == len(star_positions):
        closest_star = star_positions[-1]
    else:
        left_star = star_positions[pos - 1]
        right_star = star_positions[pos]
        closest_star = left_star if abs(left_star - robot_pos) <= abs(right_star - robot_pos) else right_star

    # Update steps and coins
    total_steps += abs(robot_pos - closest_star)
    total_coins += 1
    robot_pos = closest_star

    # Remove collected star
    star_positions.remove(closest_star)

print(total_steps, total_coins)

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: ACCEPTED

Test 4

Group: 1, 2

Verdict: WRONG ANSWER

Test 5

Group: 1, 2

Verdict: ACCEPTED

Test 6

Group: 1, 2

Verdict: ACCEPTED

Test 7

Group: 1, 2

Verdict: ACCEPTED

Test 8

Group: 1, 2

Verdict: WRONG ANSWER

Test 9

Group: 1, 2

Verdict: WRONG ANSWER

Test 10

Group: 1, 2

Verdict: ACCEPTED

Test 11

Group: 1, 2

Verdict: ACCEPTED

Test 12

Group: 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: ACCEPTED

Test 14

Group: 2

Verdict: ACCEPTED

Test 15

Group: 2

Verdict: ACCEPTED

Test 16

Group: 2

Verdict: ACCEPTED

Test 17

Group: 2

Verdict: ACCEPTED

Test 18

Group: 2

Verdict: ACCEPTED

Test 19

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 20

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 21

Group: 2

Verdict: ACCEPTED

Test 22

Group: 2

Verdict: ACCEPTED

Test 23

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 24

Group: 2

Verdict: TIME LIMIT EXCEEDED