Robotti

input/code.cpp: In function 'int findRobot(std::string, int)':
input/code.cpp:8:30: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
    8 |         for (size_t i = 0; i < mapsize; i++)
      |                            ~~^~~~~~~~~
input/code.cpp: In function 'int findClosestCoin(std::string, int, int)':
input/code.cpp:24:30: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'const int' [-Wsign-compare]
   24 |         for (size_t i = 1; i < max(mapsize-robot, robot-mapsize); i++)
      |                            ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

//#include "bits/stdc++.h";
#include <bits/stdc++.h>
 
using namespace std;
 
int findRobot(string map, int mapsize)
{
	for (size_t i = 0; i < mapsize; i++)
	{
		if (map[i] == 'R')
		{
			return i;
		}
	}
	return 0;
}
void moveRobot(string* map, int from, int to)
{
	map->at(from) = '.';
	map->at(to) = 'R';
}
int findClosestCoin(string map, int mapsize, int robot)
{
	for (size_t i = 1; i < max(mapsize-robot, robot-mapsize); i++)
	{
		bool right = false;
		bool left = false;
 
		int rightPos = robot + i;
		int leftPos = robot - i;
 
		// Onko oikealla kolikko?
		if (rightPos < mapsize)
		{
			right = map[rightPos] == '*';
		}
		// Vasen
		if (leftPos > -1)
		{
			left = map[leftPos] == '*';
		}
 
		if (right && left)
		{
			// Kahden kolikon v�liss�
			return -1;
		}
		if (right)
		{
			return rightPos;
		}
		if (left)
		{
			return leftPos;
		}
	}
	return -1;
}
 
 
int main()
{
	int rooms;
	string map;
	cin >> rooms;
	cin >> map;
 
	int steps = 0;
	int coins = 0;
 
	int robotPos = findRobot(map, rooms);
	int closestCoin = findClosestCoin(map, rooms, robotPos);
 
	while (closestCoin != -1)
	{
		steps += abs(closestCoin - robotPos);
		coins++;
 
		moveRobot(&map, robotPos, closestCoin);
 
		robotPos = findRobot(map, rooms);
		closestCoin = findClosestCoin(map, rooms, robotPos);
	}
 
	cout << steps << " " << coins;
}

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: WRONG ANSWER

Test 7

Group: 1, 2

Verdict: WRONG ANSWER

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: WRONG ANSWER

Test 12

Group: 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: WRONG ANSWER

Test 14

Group: 2

Verdict: WRONG ANSWER

Test 15

Group: 2

Verdict: ACCEPTED

Test 16

Group: 2

Verdict: WRONG ANSWER

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: WRONG ANSWER