Robotti

input/code.cpp: In instantiation of 'search(int)::<lambda(auto:47)> [with auto:47 = std::_Bit_reference]':
/usr/include/c++/11/bits/predefined_ops.h:318:23:   required from 'constexpr bool __gnu_cxx::__ops::_Iter_pred<_Predicate>::operator()(_Iterator) [with _Iterator = std::_Bit_iterator; _Predicate = search(int)::<lambda(auto:47)>]'
/usr/include/c++/11/bits/stl_algobase.h:2125:12:   required from 'constexpr typename std::iterator_traits< <template-parameter-1-1> >::difference_type std::__count_if(_InputIterator, _InputIterator, _Predicate) [with _InputIterator = std::_Bit_iterator; _Predicate = __gnu_cxx::__ops::_Iter_pred<search(int)::<lambda(auto:47)> >; typename std::iterator_traits< <template-parameter-1-1> >::difference_type = long int]'
/usr/include/c++/11/bits/stl_algo.h:4091:29:   required from 'constexpr typename std::iterator_traits< <template-parameter-1-1> >::difference_type std::count_if(_IIter, _IIter, _Predicate) [with _IIter = std::_Bit_iterator; _Predicate = search(i...

#include <bits/stdc++.h>

using namespace std;

vector<bool> rooms {};
int moves {}, coins {};

void search(int rPos)
{
    int i {};
    int closestLeft {-1}, closestRight {-1};
    int n = count_if(rooms.begin(), rooms.end(), [&](auto e)
    {
        std::cout << e ? true : false;
        if(i == rPos)
        {
            ++i;
            return false;
        }
        if(e)
        {
            if(rPos > i)
            {
                closestLeft = i;
            }
            else 
            {
                if(closestRight == -1)
                    closestRight = i;
            }
        }
        ++i;
        return e ? true : false;
    });
    std::cout << "\n";
    if(!n) return;

    int dif1 {rPos - closestLeft}, dif2 {closestRight - rPos};
    if(dif1 != dif2)
    {
        if(closestLeft == -1)
        {
            closestLeft = closestRight;
            dif1 = dif2;
        }
        else if(closestRight != -1)
        {
            if(dif1 > dif2)
            {
                closestLeft = closestRight;
                dif1 = dif2;
            }
        }

        rooms[closestLeft] = false;
        ++coins;
        moves += dif1;
        search(closestLeft);
    }
}

int main()
{
    int n {};
    cin >> n;

    rooms.reserve(n);

    int rPos {};
    for(int i {}; i < n; ++i)
    {
        char c {};
        cin >> c;
        if(c == 'R') rPos = i;
        rooms.push_back(c == '*' ? true : false);
    }
    
    search(rPos);
    cout << moves << ' ' << coins;
    return 0;
}

Test 1

Group: 1, 2

Verdict: WRONG ANSWER

Test 2

Group: 1, 2

Verdict: WRONG ANSWER

Test 3

Group: 1, 2

Verdict: WRONG ANSWER

Test 4

Group: 1, 2

Verdict: WRONG ANSWER

Test 5

Group: 1, 2

Verdict: WRONG ANSWER

Test 6

Group: 1, 2

Verdict: WRONG ANSWER

Test 7

Group: 1, 2

Verdict: WRONG ANSWER

Test 8

Group: 1, 2

Verdict: WRONG ANSWER

Test 9

Group: 1, 2

Verdict: WRONG ANSWER

Test 10

Group: 1, 2

Verdict: WRONG ANSWER

Test 11

Group: 1, 2

Verdict: WRONG ANSWER

Test 12

Group: 2

Verdict: WRONG ANSWER

Test 13

Group: 2

Verdict: WRONG ANSWER

Test 14

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 2

Verdict: WRONG ANSWER

Test 16

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 2

Verdict: WRONG ANSWER

Test 18

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 19

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 20

Group: 2

Verdict: WRONG ANSWER

Test 21

Group: 2

Verdict: WRONG ANSWER

Test 22

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 23

Group: 2

Verdict: WRONG ANSWER

Test 24

Group: 2

Verdict: TIME LIMIT EXCEEDED