Robotti

input/code.cpp: In function 'int getNear(const std::vector<int>&, int)':
input/code.cpp:13:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     for (int i = 0; i < vec.size(); ++i) {
      |                     ~~^~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:59:33: warning: 'myPos' may be used uninitialized in this function [-Wmaybe-uninitialized]
   59 |         steps += std::abs(myPos - oldPos);
      |                           ~~~~~~^~~~~~~~

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <climits>

//#define PAUSE system("pause")

int getNear(const std::vector<int>& vec, int target) {
    int closest = -1;
    int minDiff = INT_MAX;

    for (int i = 0; i < vec.size(); ++i) {
        int currentDiff = std::abs(target - vec[i]);
        if (currentDiff < minDiff) {
            minDiff = currentDiff;
            closest = vec[i];
        } else if (currentDiff == minDiff) {
            closest = -1;
        }
    }
    return closest;
}

int main() {
    int mapSize, steps = 0, allc = 0;
    std::vector<char> mapVec;
    char el_buffer;

    std::cin >> mapSize;

    for (int i = 0; i < mapSize; i++) {
        std::cin >> el_buffer;
        mapVec.push_back(el_buffer);
    }

    std::vector<int> moneyVec;
    int myPos;

    for (int i = 0; i < mapSize; i++) {
        if (mapVec[i] == '*') {
            moneyVec.push_back(i);
        } else if (mapVec[i] == 'R') {
            myPos = i;
        }
    }

    while (true) {
        int oldPos = myPos;
        myPos = getNear(moneyVec, myPos);

        if (myPos == -1) {
            break;
        }

        mapVec[oldPos] = '.';
        mapVec[myPos] = 'R';
        allc++;
        steps += std::abs(myPos - oldPos);

        moneyVec.erase(std::remove(moneyVec.begin(), moneyVec.end(), myPos), moneyVec.end());
    }

    std::cout << steps << ' ' << allc << std::endl;
    //PAUSE;
    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: TIME LIMIT EXCEEDED

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