Robotti

input/code.cpp: In function 'int etsi(std::vector<std::__cxx11::basic_string<char> >, int)':
input/code.cpp:15:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     } else if (robottiIndeksi == (kolikotX.size() - 1)){
      |                ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:42:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for (int i = 0; i < map.size(); i++) {
      |                     ~~^~~~~~~~~~~~
input/code.cpp:67:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |             for(int i = 100; i < kolikot...

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

int robottiIndeksi;

int etsi(vector<string> kolikotX, int robottiX){

    if (kolikotX.size() <= 1){
        return 0;
    } else if (robottiIndeksi == 0){
        return stoi(kolikotX[1]) - robottiX;
    } else if (robottiIndeksi == (kolikotX.size() - 1)){
        robottiIndeksi--;
        return stoi(kolikotX[kolikotX.size() - 2]) - robottiX;
    }

    int oik = abs(stoi(kolikotX[robottiIndeksi + 1]) - robottiX);
    int vas = abs(stoi(kolikotX[robottiIndeksi - 1]) - robottiX);

    if (oik < vas) {
        return oik;
    } else if (vas < oik) {
        robottiIndeksi--;
        return -vas;
    } else {
        return 0;
    }
}

int main() { 
    int n;
    cin >> n;
    string map;
    cin >> map;
    
    vector<string> kolikotX;
    int robottiX = 0;
    cout << map.size() << '\n';
    for (int i = 0; i < map.size(); i++) {
        if (map[i] == '*'){
            kolikotX.push_back(to_string(i));
            continue;
        } else if (map[i] == 'R'){
            robottiX = i;
            kolikotX.push_back("R");
            robottiIndeksi = kolikotX.size() - 1;
        }
    }

    int askelia = 0;
    int kolikoita = 0;
    int d = 0;
    while (true){
        int et = etsi(kolikotX, robottiX);
        if (et == 0){
            break;
        }
        askelia = askelia + abs(et);
        robottiX = robottiX + et;
        kolikoita++;
        kolikotX.erase(remove(kolikotX.begin(), kolikotX.end(), to_string(robottiX)), kolikotX.end());
        if (d < 1){
            string ou = "";
            for(int i = 100; i < kolikotX.size(); i++){
                ou = ou + " " + kolikotX[i];
            }

            cout << ou << '\n';
            d++;
        }
        

        /* Alternatively
        for(int element : myVector)
            cout << element << '\n';
        */

        if (kolikotX.size() == 0) {
            break;
        }
        
    }
    cout << askelia << " " << kolikoita << "\n";
    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: WRONG ANSWER

Test 15

Group: 2

Verdict: WRONG ANSWER

Test 16

Group: 2

Verdict: WRONG ANSWER

Test 17

Group: 2

Verdict: WRONG ANSWER

Test 18

Group: 2

Verdict: WRONG ANSWER

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

Test 23

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 24

Group: 2

Verdict: TIME LIMIT EXCEEDED