Robotti

import java.util.Scanner;
 
public class Main {
    static String reverseString(String str){
        // solution from https://www.geeksforgeeks.org/reverse-a-string-in-java/
 
        String nstr="";
        char ch;
        for (int i=0; i<str.length(); i++)
        {
            ch= str.charAt(i); //extracts each character
            nstr= ch+nstr; //adds each character in front of the existing string
        }
        return nstr;
    }
 
    static Double moveRight(String path, int robot_position){
        String subPath = path.substring(robot_position+1);
 
        if(subPath.indexOf("*") == -1){
            return Double.POSITIVE_INFINITY;
        }
        for(int i = 0; i < subPath.length(); i++){
            if(subPath.charAt(i) == '*'){
                return (double) i + 1;
            }
        }
        return Double.POSITIVE_INFINITY;
    }
    static Double moveLeft(String path, int robot_position){
        String subPath = reverseString(path.substring(0,robot_position));
 
        if(subPath.indexOf("*") == -1){
            return Double.POSITIVE_INFINITY;
        }
        for(int i = 0; i < subPath.length(); i++){
            if(subPath.charAt(i) == '*'){
                return (double) i + 1;
            }
        }
        return Double.POSITIVE_INFINITY;
    }
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int room = input.nextInt();
        input.nextLine();
        String path = input.nextLine();
        char[] charPath = path.toCharArray();
        int robot_position = path.indexOf("R");
        Double epsilon = 0.0001;
        
        int stepsTaken = 0;
        int coinsCollected = 0;
        while (true) {
            Double leftDist = moveLeft(String.valueOf(charPath), robot_position);
            Double rightDist = moveRight(String.valueOf(charPath), robot_position);
 
            if (Math.abs(leftDist - rightDist) < epsilon){
                break;
            }
            else if (String.valueOf(charPath).indexOf("*") == -1){
                break;
            }
            if(leftDist < rightDist){
                charPath[robot_position] = '.';
                robot_position -= leftDist;
                charPath[robot_position] = 'R';
                stepsTaken += leftDist;
                coinsCollected += 1;
            }
            else if(rightDist < leftDist){
                charPath[robot_position] = '.';
                robot_position += rightDist;
                charPath[robot_position] = 'R';
                stepsTaken += rightDist;
                coinsCollected += 1;
            }
        }
        System.out.println(stepsTaken+" "+coinsCollected);
 
    }
}

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: ACCEPTED

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: ACCEPTED

Test 9

Group: 1, 2

Verdict: ACCEPTED

Test 10

Group: 1, 2

Verdict: ACCEPTED

Test 11

Group: 1, 2

Verdict: ACCEPTED

Test 12

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 18

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 19

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 20

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 21

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 22

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 23

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 24

Group: 2

Verdict: TIME LIMIT EXCEEDED