Robotti

#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<long> 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<long>(startPos) };
 
    auto firstCoin{ coinPositions.begin() };
    auto lastCoin{ coinPositions.end() };
 
    while (totalCoins < maxCoins) {
        auto nearestCoin = std::lower_bound(firstCoin, lastCoin, currentPos);
        auto nearestLeft = std::prev(nearestCoin);
        auto pluslength{ (nearestCoin != lastCoin) ? *nearestCoin - currentPos : -1 };
        auto minuslength{ (nearestLeft != firstCoin) ? currentPos - *std::prev(nearestCoin) : -1 };
        
        if (pluslength < minuslength) {
            currentPos += pluslength;
            coinPositions.erase(nearestCoin);
            totalMove += pluslength;
        } else if (pluslength != minuslength) {
            currentPos -= minuslength;
            coinPositions.erase(nearestCoin - 1);
            totalMove += minuslength;
        } else break;
 
        ++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: RUNTIME ERROR

code: malloc.c:2617: sysmalloc: Assertion `(old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)' failed.

Test 4

Group: 1, 2

Verdict: ACCEPTED

Test 5

Group: 1, 2

Verdict: RUNTIME ERROR

munmap_chunk(): invalid pointer

Test 6

Group: 1, 2

Verdict: RUNTIME ERROR

free(): invalid size

Test 7

Group: 1, 2

Verdict: RUNTIME ERROR

malloc(): mismatching next->prev_size (unsorted)

Test 8

Group: 1, 2

Verdict: ACCEPTED

Test 9

Group: 1, 2

Verdict: ACCEPTED

Test 10

Group: 1, 2

Verdict: RUNTIME ERROR

malloc(): mismatching next->prev_size (unsorted)

Test 11

Group: 1, 2

Verdict: WRONG ANSWER

Test 12

Group: 2

Verdict: RUNTIME ERROR

Test 13

Group: 2

Verdict: RUNTIME ERROR

munmap_chunk(): invalid pointer

Test 14

Group: 2

Verdict: RUNTIME ERROR

malloc(): mismatching next->prev_size (unsorted)

Test 15

Group: 2

Verdict: RUNTIME ERROR

Test 16

Group: 2

Verdict: WRONG ANSWER

Test 17

Group: 2

Verdict: ACCEPTED

Test 18

Group: 2

Verdict: RUNTIME ERROR

munmap_chunk(): invalid pointer

Test 19

Group: 2

Verdict: RUNTIME ERROR

Test 20

Group: 2

Verdict: ACCEPTED

Test 21

Group: 2

Verdict: RUNTIME ERROR

Test 22

Group: 2

Verdict: RUNTIME ERROR

malloc(): mismatching next->prev_size (unsorted)

Test 23

Group: 2

Verdict: RUNTIME ERROR

Test 24

Group: 2

Verdict: WRONG ANSWER