CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:DLPS
Submission time:2024-10-28 10:29:07 +0200
Language:C++ (C++20)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2details
#2ACCEPTED0.00 s1, 2details
#30.00 s1, 2details
#4ACCEPTED0.00 s1, 2details
#50.00 s1, 2details
#60.00 s1, 2details
#70.00 s1, 2details
#8ACCEPTED0.00 s1, 2details
#9ACCEPTED0.00 s1, 2details
#100.01 s1, 2details
#110.00 s1, 2details
#120.01 s2details
#130.00 s2details
#140.00 s2details
#150.00 s2details
#160.00 s2details
#17ACCEPTED0.01 s2details
#180.00 s2details
#190.00 s2details
#20ACCEPTED0.01 s2details
#210.01 s2details
#220.00 s2details
#230.00 s2details
#240.01 s2details

Code

//#include "bits/stdc++.h";
#include <bits/stdc++.h>

using namespace std;

int findRobot(string map, int mapsize)
{
	for (int 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 (int 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)
	{
		cout << robotPos << " " << closestCoin << "\n";
		steps += abs(closestCoin - robotPos);
		coins++;

		moveRobot(&map, robotPos, closestCoin);
		cout << map << "\n";

		robotPos = findRobot(map, rooms);
		closestCoin = findClosestCoin(map, rooms, robotPos);
	}

	cout << steps << " " << coins;
}

Test details

Test 1

Group: 1, 2

Verdict: ACCEPTED

input
1
R

correct output
0 0

user output
0 0

Test 2

Group: 1, 2

Verdict: ACCEPTED

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

correct output
0 0

user output
0 0

Test 3

Group: 1, 2

Verdict:

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

correct output
12 5

user output
3 1
*R.....***
1 0
R......***
0 7
...

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
0 148
.................................

Test 6

Group: 1, 2

Verdict:

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

correct output
886 9

user output
0 0

Test 7

Group: 1, 2

Verdict:

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

correct output
1287 400

user output
700 698
.....*..*....**..**..*......*....

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
0 1
.R****************************...

Test 11

Group: 1, 2

Verdict:

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

correct output
999 999

user output
0 0

Test 12

Group: 2

Verdict:

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

correct output
10971 999

user output
999 1002
.......**........*...........*...

Test 13

Group: 2

Verdict:

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

correct output
9999 999

user output
0 0

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
0 0

Test 17

Group: 2

Verdict: ACCEPTED

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

correct output
0 0

user output
0 0

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
0 70142
.................................

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
0 0