Robotti

#include <iostream>
#include <vector>
#include <string>

using namespace std;

int main()
{
    string huoneet;
    int n;
    cin >> n >> huoneet;
    vector<int> locations;
    int pos;
    int askeleet = 0;
    int kolikot = 0;
    for (int i = 1; i < n + 1; i++)
    {
        if (huoneet.at(i - 1) == '*')
        {
            locations.push_back(i);
        }
        else if (huoneet.at(i - 1) == 'R')
        {
            pos = i;
        }
    }
    while (locations.size() > 0)
    {
        int start = 0;
        int m = locations.size() - 1;
        int end = m;
        int nearestIdx = 0;
        bool foundLeft = false;
        while (start <= end)
        {
            int mid = (start + end) / 2;
            if ((locations[mid] < pos) && (mid == m + 1 || locations[mid + 1] > pos))
            {
                nearestIdx = mid;
                foundLeft = true;
                break;
            }
            else if ((locations[mid] > pos) && (mid == 0 || locations[mid - 1] < pos))
            {
                nearestIdx = mid;
                break;
            }

            if (locations[mid] > pos)
            {
                end = mid - 1;
            }
            else if (locations[mid] < pos)
            {
                start = mid + 1;
            }
        }
        int dist = -1;
        if (foundLeft)
        {
            if (nearestIdx == m || locations[nearestIdx + 1] - pos > pos - locations[nearestIdx])
            {
                dist = pos - locations[nearestIdx];
            }
            else if (locations[nearestIdx + 1] - pos == pos - locations[nearestIdx])
            {
                break;
            }
            else
            {
                dist = locations[nearestIdx + 1] - pos;
                nearestIdx++;
            }
        }
        else
        {
            if (nearestIdx == 0 || pos - locations[nearestIdx - 1] > locations[nearestIdx] - pos)
            {
                dist = locations[nearestIdx] - pos;
            }
            else if (locations[nearestIdx] - pos == pos - locations[nearestIdx - 1])
            {
                break;
            }
            else
            {
                dist = pos - locations[nearestIdx - 1];
                nearestIdx--;
            }
        }
        kolikot++;
        askeleet += dist;
        pos = locations[nearestIdx];
        locations.erase(locations.begin() + nearestIdx);
    }

    cout << askeleet << " " << kolikot << "\n";
    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: WRONG ANSWER

Test 7

Group: 1, 2

Verdict: WRONG ANSWER

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: WRONG ANSWER

Test 12

Group: 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: WRONG ANSWER

Test 14

Group: 2

Verdict: WRONG ANSWER

Test 15

Group: 2

Verdict: ACCEPTED

Test 16

Group: 2

Verdict: WRONG ANSWER

Test 17

Group: 2

Verdict: ACCEPTED

Test 18

Group: 2

Verdict: ACCEPTED

Test 19

Group: 2

Verdict: WRONG ANSWER

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