Robotti

input/code.cpp: In function 'int main()':
input/code.cpp:54:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     for (int i {0}; i < coinPositions.size(); ++i) {
      |                     ~~^~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:63:30: warning: comparison of integer expressions of different signedness: 'int' and 'long unsigned int' [-Wsign-compare]
   63 |     while (LDir >= 0 || RDir < coinAmount) {
      |                         ~~~~~^~~~~~~~~~~~
input/code.cpp:65:32: warning: comparison of integer expressions of different signedness: 'int' and 'long unsigned int' [-Wsign-compare]
   65 |         int plusLength = (RDir < coinAmount) ? std::abs(currentPos - coinPositions[RDir]) : 300000;
      |                           ~~~~~^~~~~~~~~~~~

#include <iostream>
#include <string>
#include <vector>
/*#include <random>
#include <chrono>*/

int main() {
    unsigned long totalMove{0};
    long totalCoins{0};

    long roomAmount;
    std::cin >> roomAmount;

    std::string rooms;
    std::cin >> rooms;

    // Testaukseen suurilla luvuilla
    /*std::string jono;
    //jono.reserve(roomAmount);
    std::random_device rd;
    std::mt19937 gen(rd());
    std::uniform_int_distribution charDist(0, 3);
    for (long i = 0; i < 199999; ++i) {
        char nextChar = ".***"[charDist(gen)];
        jono += nextChar;
    }
    std::uniform_int_distribution startLoc(0, 199999);
    jono[startLoc(gen)] = 'R';
    std::string rooms{jono};
    auto roomAmount = static_cast<long>(rooms.length());
    auto startTime { std::chrono::high_resolution_clock::now() };*/

    long maxCoins{0};
    auto startPos{0};
    std::vector<int> coinPositions;
    for (auto i = 0; i < roomAmount; ++i) {
        if (rooms[i] == '*') {
            ++maxCoins;
            coinPositions.push_back(i);
        } else if (rooms[i] == 'R') startPos = i;
    }

    //auto startPos{ rooms.find('R') };
    auto currentPos{ static_cast<int>(startPos) };

    //auto firstCoin{ coinPositions.begin() };
    //auto lastCoin{ coinPositions.end() };
    auto coinAmount { coinPositions.size() };

    // Koska en kuitenkaan muista enää huomenna miksi tein tämän ja menetän siksi 5 minuuttia:
    // Etsii ensimmäiset kolikot sekä vasemmalle suunnalle ja oikealle suunnalle.
    int LDir {-1};
    int RDir {-1};
    for (int i {0}; i < coinPositions.size(); ++i) {
        if (coinPositions[i] < currentPos) {
            LDir = i;
        } else {
            RDir = i;
            break;
        }
    }

    while (LDir >= 0 || RDir < coinAmount) {
        int minusLength = (LDir >= 0) ? std::abs(currentPos - coinPositions[LDir]) : 300000; //300 000 koska en jaksa lisätä climitsiä taas
        int plusLength = (RDir < coinAmount) ? std::abs(currentPos - coinPositions[RDir]) : 300000;

        if (minusLength == plusLength) {
            break;
        } else if (minusLength < plusLength) {
            totalMove += minusLength;
            currentPos = coinPositions[LDir];
            --LDir;
        } else {
            totalMove += plusLength;
            currentPos = coinPositions[RDir];
            ++RDir;
        }
        ++totalCoins;
    }

    std::cout << totalMove << " " << totalCoins << "\n";

    // Testaukseen
   /* auto endTime{std::chrono::high_resolution_clock::now()};
    auto duration{std::chrono::duration_cast<std::chrono::milliseconds>(endTime - startTime)};
    int durationInt = static_cast<int>(duration.count());
    std::cout << durationInt << "\n";*/
    // Syötteen esimerkki omaa muistia varten: **.*......*.R*...*..

    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