Robotti

#include <iostream>
#include <string>
#include <cmath>
using namespace std;

int main() {
    int n;
    string rooms;
    cin >> n >> rooms;

    int robot_position = rooms.find('R');
    int steps = 0, coins = 0;

    // Pidetään kirjaa vasemmista ja oikeista kolikoista
    int left = -1, right = -1;

    // Etsi lähin kolikko vasemmalta
    for (int i = robot_position - 1; i >= 0; i--) {
        if (rooms[i] == '*') {
            left = i;
            break;
        }
    }

    // Etsi lähin kolikko oikealta
    for (int i = robot_position + 1; i < n; i++) {
        if (rooms[i] == '*') {
            right = i;
            break;
        }
    }

    while (left != -1 || right != -1) {
        int left_distance = (left != -1) ? robot_position - left : n;
        int right_distance = (right != -1) ? right - robot_position : n;

        if (left_distance < right_distance) {
            steps += left_distance;
            robot_position = left;
            left = -1; // Kolikko on kerätty, poista vasemmanpuoleinen kolikko
        } else if (right_distance < left_distance) {
            steps += right_distance;
            robot_position = right;
            right = -1; // Kolikko on kerätty, poista oikeanpuoleinen kolikko
        } else {
            break; // Molemmat kolikot yhtä kaukana, pysähdy
        }

        coins++;
        rooms[robot_position] = '.'; // Poista kolikko

        // Päivitä lähimmät kolikot
        if (left == -1) {
            for (int i = robot_position - 1; i >= 0; i--) {
                if (rooms[i] == '*') {
                    left = i;
                    break;
                }
            }
        }

        if (right == -1) {
            for (int i = robot_position + 1; i < n; i++) {
                if (rooms[i] == '*') {
                    right = i;
                    break;
                }
            }
        }
    }

    cout << steps << " " << coins << endl;

    return 0;
}




//6.11.2024 11:22 Onni Kolehmaienen
// Syöte esimerkki:
//20
//**.*......*.R*...*..
//Tuloste:
//4 2

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

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