Robotti

input/code.cpp: In function 'int main()':
input/code.cpp:30:9: warning: unused variable 'randInt' [-Wunused-variable]
   30 |     int randInt;
      |         ^~~~~~~
input/code.cpp: In function 'int countCoins(const string&)':
input/code.cpp:48:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for (int i=0; i<series.size(); i++) {
      |                   ~^~~~~~~~~~~~~~
input/code.cpp: In function 'std::vector<int> getCharIdxs(const string&, char)':
input/code.cpp:57:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |     for (int i=0; i<series.size(); i++) {
      |                   ~^~~~~~~~~~~~~~
input/code.cpp: In function 'std::vector<int> getStepsClosestCoinIdx(const string&, std::vector<int>&, int, int&)':
input/code.cp...

#include <iostream>
#include <string>
#include <vector>

const char CHARS[3] = "*.";

int getDistance(int idx1, int idx2);

int countCoins(const std::string& series); // carrots taste good anyways ¯\_(ツ)_/¯

std::vector<int> getCharIdxs(const std::string& series, const char carrot); 

std::vector<int> getStepsClosestCoinIdx(
    const std::string& series,
    std::vector<int>& coinIdxs, 
    int robotIdx,
    int& robotIdxIdx);

std::vector<int> getStepsCoins(std::string& roomSeries);


int main() {
    int roomAmount; // perhaps the most useless var of this century
    std::string roomSeries;

    
    std::cin >> roomAmount;
    std:: cin >> roomSeries;
    
    int randInt;

    std::vector<int> stepsCoins = getStepsCoins(roomSeries);

    std::cout << stepsCoins.at(0) << " " << stepsCoins.at(1);

    return 0;
}



int getDistance(int idx1, int idx2) {
    return abs(idx2 - idx1);
}

int countCoins(const std::string& series) {
    // slightly (heavily) unnecessary function...
    int count = 0;
    for (int i=0; i<series.size(); i++) {
        if (series[i] == '*') count++;
    }
    return count;
}

std::vector<int> getCharIdxs(const std::string& series, const char carrot) {
    std::vector<int> carrotIndexes;

    for (int i=0; i<series.size(); i++) {
        if (series[i] == carrot) carrotIndexes.push_back(i);
    }

    return carrotIndexes;
}

// toimii ainakin yleensä... toivottavasti aina
std::vector<int> getStepsClosestCoinIdx(
    const std::string& series,
    std::vector<int>& coinIdxs, 
    int robotIdx,
    int& robotIdxIdx
    ) 
{
    int dist1, dist2, coin1Idx, coin2Idx;

    if (robotIdxIdx == coinIdxs.size()-1) {
        coin1Idx = coinIdxs[robotIdxIdx-1];
        dist1 = getDistance(coin1Idx, robotIdx);
        coinIdxs.erase(coinIdxs.begin() + robotIdxIdx);
        robotIdxIdx--;
        return {dist1, coin1Idx};
    }
    if (robotIdxIdx == 0) {
        coin2Idx = coinIdxs[1];
        dist2 = getDistance(coin2Idx, robotIdx);
        coinIdxs.erase(coinIdxs.begin());
        return {dist2, coin2Idx};
    }

    coin1Idx = coinIdxs[robotIdxIdx-1];
    coin2Idx = coinIdxs[robotIdxIdx+1];
    
    dist1 = getDistance(coin1Idx, robotIdx);
    dist2 = getDistance(coin2Idx, robotIdx);

    if (dist1 == dist2) {
        return {dist1, coin1Idx, coin2Idx};
    }

    if (dist1 < dist2) {
        coinIdxs.erase(coinIdxs.begin() + robotIdxIdx);
        robotIdxIdx--;
        return {dist1, coin1Idx};
    }

    coinIdxs.erase(coinIdxs.begin() + robotIdxIdx);
    return {dist2, coin2Idx};
}

std::vector<int> getStepsCoins(std::string& roomSeries) {
    if (roomSeries.size() == 1) return {0, 0};

    int steps=0, gatheredCoins=0, robotIdx, robotIdxIdx, coinIdx;

    int coinsTotalAmount = countCoins(roomSeries);

    std::vector<int> stepsCoinIdx, coinIdxs;

    for (int i=0; i<roomSeries.size(); i++) {
        if (roomSeries[i] == '*') {
            coinIdxs.push_back(i);
        } else if (roomSeries[i] == 'R') {
            robotIdx = i;
            robotIdxIdx = coinIdxs.size(); // robotti sijaitsee täällä på coinIdxs listas
            coinIdxs.push_back(i);
        }
    }

    for (int i=0; i<coinsTotalAmount; i++) {
        stepsCoinIdx = getStepsClosestCoinIdx(roomSeries, coinIdxs, robotIdx, robotIdxIdx);
        coinIdx = stepsCoinIdx.at(1);

        if (stepsCoinIdx.size() > 2) break;

        roomSeries[coinIdx] = 'R';
        roomSeries[robotIdx] = '.';
        robotIdx = coinIdx;

        steps += stepsCoinIdx.at(0);
        gatheredCoins++;

        if (gatheredCoins >= coinsTotalAmount) break;
    }

    return {steps, gatheredCoins};
}

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: TIME LIMIT EXCEEDED

Test 24

Group: 2

Verdict: ACCEPTED