CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:DLPS
Submission time:2024-10-28 10:19:51 +0200
Language:C++ (C++20)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#1--1, 2details
#2--1, 2details
#3--1, 2details
#4ACCEPTED0.00 s1, 2details
#5--1, 2details
#6--1, 2details
#7--1, 2details
#8ACCEPTED0.00 s1, 2details
#9ACCEPTED0.00 s1, 2details
#10--1, 2details
#11--1, 2details
#12--2details
#13--2details
#14--2details
#15--2details
#16--2details
#17--2details
#18--2details
#19--2details
#20ACCEPTED0.01 s2details
#21--2details
#22--2details
#23--2details
#24--2details

Compiler report

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:

input
1
R

correct output
0 0

user output
(empty)

Test 2

Group: 1, 2

Verdict:

input
10
...R......

correct output
0 0

user output
(empty)

Test 3

Group: 1, 2

Verdict:

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:

input
1000
R................................

correct output
947 9

user output
(empty)

Test 6

Group: 1, 2

Verdict:

input
1000
.................................

correct output
886 9

user output
(empty)

Test 7

Group: 1, 2

Verdict:

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:

input
1000
R*****************************...

correct output
999 999

user output
(empty)

Test 11

Group: 1, 2

Verdict:

input
1000
******************************...

correct output
999 999

user output
(empty)

Test 12

Group: 2

Verdict:

input
10000
.......**........*...........*...

correct output
10971 999

user output
(empty)

Test 13

Group: 2

Verdict:

input
10000
*..*....*......*.....*..*........

correct output
9999 999

user output
(empty)

Test 14

Group: 2

Verdict:

input
10000
*.*.*...**.*...*....**.**.**.....

correct output
18766 5000

user output
(empty)

Test 15

Group: 2

Verdict:

input
10000
R*****************************...

correct output
9999 9999

user output
(empty)

Test 16

Group: 2

Verdict:

input
10000
******************************...

correct output
9999 9999

user output
(empty)

Test 17

Group: 2

Verdict:

input
200000
.................................

correct output
0 0

user output
(empty)

Test 18

Group: 2

Verdict:

input
200000
.................................

correct output
299934 10000

user output
(empty)

Test 19

Group: 2

Verdict:

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:

input
200000
R................................

correct output
133765 3

user output
(empty)

Test 22

Group: 2

Verdict:

input
200000
R................................

correct output
199982 5000

user output
(empty)

Test 23

Group: 2

Verdict:

input
200000
R*****************************...

correct output
199999 199999

user output
(empty)

Test 24

Group: 2

Verdict:

input
200000
******************************...

correct output
199999 199999

user output
(empty)