Robotti

#include <iostream>
#include <vector>
#include <string>
 
using namespace std;
 
int main(){
    int roomSize = 0;
    cin >> roomSize;
 
    string rooms;
    cin >> rooms;
 
    int robotIndex = 0;
    int robotCoinIndex = 1;
    bool robotFound = false;
    vector<int> coinIndex = {};
    for(int i = 0; i < roomSize; i++){
        if(rooms[i] == '*'){
            coinIndex.push_back(i);
            if(!robotFound) robotCoinIndex++;
            continue;
        }
 
        if(rooms[i] == 'R'){
            robotIndex = i;
            robotFound = true;
            robotCoinIndex--;
        }
    }
 
    long long steps = 0;
    int coinsTaken = 0;
 
    while(!coinIndex.empty()){
        if (robotCoinIndex == 0){
            int higherCoinIndex = 0;
            if(coinIndex.size() > (unsigned int)robotCoinIndex) higherCoinIndex = coinIndex.at(robotCoinIndex);
 
            coinIndex.erase(coinIndex.begin() + robotCoinIndex);
            steps += higherCoinIndex - robotIndex;
            robotIndex = higherCoinIndex;
            coinsTaken++;
 
            continue;
        }
 
        int lowerCoinIndex = coinIndex.at(robotCoinIndex - 1);
        int higherCoinIndex = 0;
        if(coinIndex.size() > (unsigned int)robotCoinIndex) higherCoinIndex = coinIndex.at(robotCoinIndex);
 
        int distanceToLower = robotIndex - lowerCoinIndex;
        if(higherCoinIndex){
            int distanceToHigher = higherCoinIndex - robotIndex;
 
            if(distanceToHigher == distanceToLower) break;
 
            if(distanceToHigher < distanceToLower){
                robotIndex = higherCoinIndex;
                coinIndex.erase(coinIndex.begin() + robotCoinIndex);
                steps += distanceToHigher;
                coinsTaken++;
                continue;
            }
        }
 
        robotIndex = lowerCoinIndex;
        coinIndex.erase(coinIndex.begin() + robotCoinIndex - 1);
        robotCoinIndex--;
        steps += distanceToLower;
        coinsTaken++;
    }
 
    cout << steps << " " << coinsTaken;
 
    return 0;
}

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

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