Kortit II

#include <iostream>
 
using namespace std;
 
int main() {
    int _len;
    string s;
    cin >> _len;
    cin >> s;
    
    int index = s.find("R", 0);
    int steps = 0, coins = 0;
    int min_left = 1, min_right = 1;
    
    while (true) {
        int _left = _len, _right = _len;
 
        for (int i = index - min_left; i >= 0; --i) {
            if (s[i] == '*') {
                _left = index - i;
                break;
            }
        }
        for (int i = index + min_right; i < _len; ++i) {
            if (s[i] == '*') {
                _right = i - index;
                break;
            }
        }
 
        if (_left < _right) {
            steps += _left;
            coins++;
            s[index] = '.';
            index -= _left;
            s[index] = 'R';
            min_right = _right+_left-1;
            min_left = 1;
        } else if (_right < _left) {
            steps += _right;
            coins++;
            s[index] = '.';
            index += _right;
            min_left = _right+_left-1;
            min_right = 1;
            s[index] = 'R';
        } else {
            break;
        }
    }
    
    cout << steps << " " << coins << "\n";
 
    return 0;
}

Test 1

Group: 1, 2, 3, 4, 5

Verdict: WRONG ANSWER

Test 2

Group: 2, 3, 4, 5

Verdict: WRONG ANSWER

Test 3

Group: 3, 4, 5

Verdict: WRONG ANSWER

Test 4

Group: 4, 5

Verdict: RUNTIME ERROR

Test 5

Group: 5

Verdict: RUNTIME ERROR

Test 6

Group: 5

Verdict: RUNTIME ERROR