Robotti

input/code.cpp: In function 'std::vector<int> CollectCoins(int, std::string, std::vector<int>, std::size_t)':
input/code.cpp:20:83: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |                 while ((((int)RobotPos-PrevSearch>=0) || ((int)RobotPos+PrevSearch<Layout.length())) && (DistanceLeft == -1 && DistanceRight == -1)) {
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
input/code.cpp:20:119: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   20 |                 while ((((int)RobotPos-PrevSearch>=0) || ((int)RobotPos+PrevSearch<Layout.length())) && (DistanceLeft == -1 && DistanceRight == -1)) {
      |                                                                                                          ~~~~~...

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

std::vector<int> CollectCoins(int Rooms, std::string Layout, std::vector<int> Output, std::size_t RobotPos = 0) {
	while (true) {
		if (RobotPos == 0) RobotPos = Layout.find('R');
		//std::cout << RobotPos << "\n";

		// Failsafe initializations
		std::size_t CoinLeft = -1;
		std::size_t DistanceLeft = -1;
		std::size_t CoinRight = -1;
		std::size_t DistanceRight = -1;

		// Iteratively search for coins
		int SearchDepth = 5;
		int PrevSearch = 0;
		while ((((int)RobotPos-PrevSearch>=0) || ((int)RobotPos+PrevSearch<Layout.length())) && (DistanceLeft == -1 && DistanceRight == -1)) {
			if (RobotPos != (size_t)0) {
				int SearchStart = (int)RobotPos-PrevSearch;
				if (SearchStart <= 0) SearchStart = 0;
				for (int i = SearchStart; (i>=SearchStart-SearchDepth) && (i>=0); i--) {
					//std::cout << "left: " << i << "\n";
					if (Layout[i]=='*') {
						CoinLeft = i;
						break;
					}
				}
				//std::cout << CoinLeft << "\n";
				if (CoinLeft!=-1) DistanceLeft = RobotPos - CoinLeft;
			}

			if (RobotPos != (size_t)(Rooms-1)) {
				int SearchStart = (int)RobotPos+PrevSearch;

				if (SearchStart >= Layout.length()) SearchStart = Layout.length()-1;
				for (int i = SearchStart; (i<=SearchStart+SearchDepth) && (i<Layout.length()); i++) {
					//std::cout << "right: "<< i << "\n";
					if (Layout[i]=='*') {
						CoinRight = i;
						break;
					}
				}
				//std::cout << CoinRight << "\n";
				if (CoinRight!=-1) DistanceRight = CoinRight - RobotPos;
			}
			PrevSearch += SearchDepth;
			//SearchDepth *= 2;
		}
		/*if (DistanceLeft < DistanceRight) {
			std::cout << "robot: "<< (int)RobotPos-PrevSearch << " " << RobotPos << " " << (int)RobotPos+PrevSearch << "\n";;
			std::cout << "left: "<< DistanceLeft << " " << CoinLeft << "\n"
				<< "right: "<< DistanceRight << " " << CoinRight << "\n" << std::endl;
			throw;
		}*/

		if (DistanceLeft==DistanceRight || ((CoinLeft == (size_t)-1) && (CoinRight == (size_t)-1))) {
			/*std::cout << "Returning with: " << "\n"
								<< "layout:\n" << Layout << "\n"
								<< "left: "<< DistanceLeft << " " << CoinLeft << "\n"
								<< "right: "<< DistanceRight << " " << CoinRight << "\n" << std::endl;
			*/
			return Output;
		}

		Layout[RobotPos] = '.';
		Output[1]++;

		//std::cout << "Robot at: " << RobotPos << "\n";
		if (DistanceLeft<DistanceRight) {
			RobotPos = CoinLeft;
			Output[0] += DistanceLeft;
			Layout[CoinLeft] = 'R';
		} else {
			RobotPos = CoinRight;
			Output[0] += DistanceRight;
			Layout[CoinRight] = 'R';
		}
		//std::cout << Layout << "\n";
		//std::cout << "Robot at: " << RobotPos << "\n";

		/*
		std::cout << "SearchDepth: " << SearchDepth/2 << "\n";
		std::cout << "CoinLeft: " << CoinLeft << "\n";
		std::cout << "CoinRight: " << CoinRight << "\n";
		std::cout << "Distances: " << DistanceLeft << " " << DistanceRight << "\n\n";
		*/
	}
}

int main () {
	// Input:
	// n rooms
	// Building layout
	// 	e.g.
	// 	20
	// 	**.*......*.R*...*..
	// * = coin; . = empty; R = robot
	int Rooms;
	std::string Layout;
	std::cin >> Rooms;
	std::cin >> Layout;

	// GOAL: Find the max number of coins the robot can collect by always going to
	// the closest coin
	std::vector<int> Output = {0,0};
	Output = CollectCoins(Rooms, Layout, Output);
	int Steps = Output[0];
	int Coins = Output[1];

	std::cout << Steps << " " << Coins << "\n";
}

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