| Task: | Robotti | 
| Sender: | DLPS | 
| Submission time: | 2024-10-28 10:19:25 +0200 | 
| Language: | C++ (C++20) | 
| Status: | READY | 
| Result: | 0 | 
| group | verdict | score | 
|---|---|---|
| #1 | TIME LIMIT EXCEEDED | 0 | 
| #2 | TIME LIMIT EXCEEDED | 0 | 
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | TIME LIMIT EXCEEDED | -- | 1, 2 | details | 
| #2 | TIME LIMIT EXCEEDED | -- | 1, 2 | details | 
| #3 | TIME LIMIT EXCEEDED | -- | 1, 2 | details | 
| #4 | ACCEPTED | 0.00 s | 1, 2 | details | 
| #5 | TIME LIMIT EXCEEDED | -- | 1, 2 | details | 
| #6 | TIME LIMIT EXCEEDED | -- | 1, 2 | details | 
| #7 | TIME LIMIT EXCEEDED | -- | 1, 2 | details | 
| #8 | ACCEPTED | 0.00 s | 1, 2 | details | 
| #9 | ACCEPTED | 0.00 s | 1, 2 | details | 
| #10 | TIME LIMIT EXCEEDED | -- | 1, 2 | details | 
| #11 | TIME LIMIT EXCEEDED | -- | 1, 2 | details | 
| #12 | TIME LIMIT EXCEEDED | -- | 2 | details | 
| #13 | TIME LIMIT EXCEEDED | -- | 2 | details | 
| #14 | TIME LIMIT EXCEEDED | -- | 2 | details | 
| #15 | TIME LIMIT EXCEEDED | -- | 2 | details | 
| #16 | TIME LIMIT EXCEEDED | -- | 2 | details | 
| #17 | TIME LIMIT EXCEEDED | -- | 2 | details | 
| #18 | TIME LIMIT EXCEEDED | -- | 2 | details | 
| #19 | TIME LIMIT EXCEEDED | -- | 2 | details | 
| #20 | ACCEPTED | 0.01 s | 2 | details | 
| #21 | TIME LIMIT EXCEEDED | -- | 2 | details | 
| #22 | TIME LIMIT EXCEEDED | -- | 2 | details | 
| #23 | TIME LIMIT EXCEEDED | -- | 2 | details | 
| #24 | TIME LIMIT EXCEEDED | -- | 2 | details | 
Compiler report
input/code.cpp:1:25: warning: extra tokens at end of #include directive
    1 | #include "bits/stdc++.h";
      |                         ^
input/code.cpp: In function 'int findClosestCoin(std::string, int)':
input/code.cpp:33:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |                 if (rightPos < map.length())
      |                     ~~~~~~~~~^~~~~~~~~~~~~~Code
#include "bits/stdc++.h";
//#include <bits/stdc++.h>
using namespace std;
int findRobot(string map)
{
	for (size_t i = 0; i < map.length(); 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 robot)
{
	for (size_t i = 1; i < max(map.length()-robot, robot-map.length()); i++)
	{
		bool right = false;
		bool left = false;
		int rightPos = robot + i;
		int leftPos = robot - i;
		// Onko oikealla kolikko?
		if (rightPos < map.length())
		{
			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);
	int closestCoin = findClosestCoin(map, robotPos);
	while (closestCoin != -1)
	{
		steps += abs(closestCoin - robotPos);
		coins++;
		moveRobot(&map, robotPos, closestCoin);
		robotPos = findRobot(map);
		closestCoin = findClosestCoin(map, robotPos);
	}
	cout << steps << " " << coins;
}Test details
Test 1
Group: 1, 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 1 R  | 
| correct output | 
|---|
| 0 0 | 
| user output | 
|---|
| (empty) | 
Test 2
Group: 1, 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 10 ...R......  | 
| correct output | 
|---|
| 0 0 | 
| user output | 
|---|
| (empty) | 
Test 3
Group: 1, 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 10 **.R...***  | 
| correct output | 
|---|
| 12 5 | 
| user output | 
|---|
| (empty) | 
Test 4
Group: 1, 2
Verdict: ACCEPTED
| input | 
|---|
| 10 ***R******  | 
| correct output | 
|---|
| 0 0 | 
| user output | 
|---|
| 0 0 | 
Test 5
Group: 1, 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 1000 R................................  | 
| correct output | 
|---|
| 947 9 | 
| user output | 
|---|
| (empty) | 
Test 6
Group: 1, 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 1000 .................................  | 
| correct output | 
|---|
| 886 9 | 
| user output | 
|---|
| (empty) | 
Test 7
Group: 1, 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 1000 .....*..*....**..**..*......*....  | 
| correct output | 
|---|
| 1287 400 | 
| user output | 
|---|
| (empty) | 
Test 8
Group: 1, 2
Verdict: ACCEPTED
| input | 
|---|
| 1000 ************.*****************...  | 
| correct output | 
|---|
| 0 0 | 
| user output | 
|---|
| 0 0 | 
Test 9
Group: 1, 2
Verdict: ACCEPTED
| input | 
|---|
| 1000 ******************************...  | 
| correct output | 
|---|
| 0 0 | 
| user output | 
|---|
| 0 0 | 
Test 10
Group: 1, 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 1000 R*****************************...  | 
| correct output | 
|---|
| 999 999 | 
| user output | 
|---|
| (empty) | 
Test 11
Group: 1, 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 1000 ******************************...  | 
| correct output | 
|---|
| 999 999 | 
| user output | 
|---|
| (empty) | 
Test 12
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 10000 .......**........*...........*...  | 
| correct output | 
|---|
| 10971 999 | 
| user output | 
|---|
| (empty) | 
Test 13
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 10000 *..*....*......*.....*..*........  | 
| correct output | 
|---|
| 9999 999 | 
| user output | 
|---|
| (empty) | 
Test 14
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 10000 *.*.*...**.*...*....**.**.**.....  | 
| correct output | 
|---|
| 18766 5000 | 
| user output | 
|---|
| (empty) | 
Test 15
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 10000 R*****************************...  | 
| correct output | 
|---|
| 9999 9999 | 
| user output | 
|---|
| (empty) | 
Test 16
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 10000 ******************************...  | 
| correct output | 
|---|
| 9999 9999 | 
| user output | 
|---|
| (empty) | 
Test 17
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 200000 .................................  | 
| correct output | 
|---|
| 0 0 | 
| user output | 
|---|
| (empty) | 
Test 18
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 200000 .................................  | 
| correct output | 
|---|
| 299934 10000 | 
| user output | 
|---|
| (empty) | 
Test 19
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 200000 **.***....**..**.....***.*..*....  | 
| correct output | 
|---|
| 299998 100000 | 
| user output | 
|---|
| (empty) | 
Test 20
Group: 2
Verdict: ACCEPTED
| input | 
|---|
| 200000 ******************************...  | 
| correct output | 
|---|
| 0 0 | 
| user output | 
|---|
| 0 0 | 
Test 21
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 200000 R................................  | 
| correct output | 
|---|
| 133765 3 | 
| user output | 
|---|
| (empty) | 
Test 22
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 200000 R................................  | 
| correct output | 
|---|
| 199982 5000 | 
| user output | 
|---|
| (empty) | 
Test 23
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 200000 R*****************************...  | 
| correct output | 
|---|
| 199999 199999 | 
| user output | 
|---|
| (empty) | 
Test 24
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 200000 ******************************...  | 
| correct output | 
|---|
| 199999 199999 | 
| user output | 
|---|
| (empty) | 
