Robotti

input/code.cpp: In function 'std::pair<int, int> solve(std::string&)':
input/code.cpp:37:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |         int left_dist = (left_idx < left_paralar.size()) ?
      |                          ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
input/code.cpp:39:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |         int right_dist = (right_idx < right_paralar.size()) ?
      |                           ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

//
//  main.cpp
//  mainCode
//
//  Created by Fatih Meric Koc on 28.10.2024.
//

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;

pair<int, int> solve(string& s) {
    int n = s.length();
    int robot_pozisyon = s.find('R');
    int adimlar = 0;
    int paralar = 0;
    
    vector<int> left_paralar, right_paralar;
    for (int i = 0; i < n; i++) {
        if (s[i] == '*') {
            if (i < robot_pozisyon) {
                left_paralar.push_back(i);
            } else {
                right_paralar.push_back(i);
            }
        }
    }
    
    reverse(left_paralar.begin(), left_paralar.end());
    
    int left_idx = 0;
    int right_idx = 0;
    
    while (true) {
        int left_dist = (left_idx < left_paralar.size()) ?
            robot_pozisyon - left_paralar[left_idx] : n;
        int right_dist = (right_idx < right_paralar.size()) ?
            right_paralar[right_idx] - robot_pozisyon : n;
        
        if (left_dist == n && right_dist == n) {
            break;
        }
        
        if (left_dist == right_dist) {
            break;
        }
        
        if (left_dist < right_dist) {
            adimlar += left_dist;
            robot_pozisyon = left_paralar[left_idx];
            left_idx++;
        } else {
            adimlar += right_dist;
            robot_pozisyon = right_paralar[right_idx];
            right_idx++;
        }
        
        paralar++;
    }
    
    return {adimlar, paralar};
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    int n;
    string s;
    cin >> n >> s;
    
    pair<int, int> result = solve(s);
    cout << result.first << " " << result.second << "\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: 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: ACCEPTED

Test 24

Group: 2

Verdict: ACCEPTED