CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:TNT
Submission time:2024-10-30 22:39:29 +0200
Language:C++ (C++17)
Status:READY
Result:30
Feedback
groupverdictscore
#1ACCEPTED30
#20
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2details
#2ACCEPTED0.00 s1, 2details
#3ACCEPTED0.00 s1, 2details
#4ACCEPTED0.00 s1, 2details
#5ACCEPTED0.00 s1, 2details
#6ACCEPTED0.00 s1, 2details
#7ACCEPTED0.01 s1, 2details
#8ACCEPTED0.00 s1, 2details
#9ACCEPTED0.00 s1, 2details
#10ACCEPTED0.01 s1, 2details
#11ACCEPTED0.01 s1, 2details
#120.40 s2details
#13ACCEPTED0.03 s2details
#14ACCEPTED0.16 s2details
#15ACCEPTED0.31 s2details
#16ACCEPTED0.29 s2details
#17ACCEPTED0.01 s2details
#180.70 s2details
#190.44 s2details
#20ACCEPTED0.01 s2details
#21ACCEPTED0.01 s2details
#220.42 s2details
#230.41 s2details
#240.43 s2details

Compiler report

input/code.cpp: In function 'std::vector<int> CollectCoins(int, std::string, std::vector<int>)':
input/code.cpp:22:22: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   22 |         if (CurRobot != Rooms+1) {
      |             ~~~~~~~~~^~~~~~~~~~

Code

#include <cstddef>
#include <iostream>
#include <string>
#include <vector>

std::vector<int> CollectCoins(int Rooms, std::string Layout, std::vector<int> Output) {
	std::size_t CurRobot = Layout.find("R");

	// Distance to the first coin left
	std::size_t CoinLeft = -1;
	std::size_t DistanceLeft = -1;
	if (CurRobot != 0) {
		CoinLeft = Layout.find_last_of("*", CurRobot);
		//std::cout << CoinLeft << "\n";
		DistanceLeft = CurRobot - CoinLeft;
	}
	//std::cout << DistanceLeft << "\n";

	// Distance to the first coin right
	std::size_t CoinRight = -1;
	std::size_t DistanceRight = -1;
	if (CurRobot != Rooms+1) {
		CoinRight = Layout.find_first_of("*", CurRobot);
		//std::cout << CoinRight << "\n";
		DistanceRight = CoinRight - CurRobot;
	}
	//std::cout << DistanceRight << "\n";

	if (DistanceLeft==DistanceRight || ((CoinLeft == (size_t)-1) && (CoinRight == (size_t)-1))) {
		return Output;
	}

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

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

	return CollectCoins(Rooms, Layout, Output);
}

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 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: ACCEPTED

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

correct output
12 5

user output
12 5

Test 4

Group: 1, 2

Verdict: ACCEPTED

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

correct output
0 0

user output
0 0

Test 5

Group: 1, 2

Verdict: ACCEPTED

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

correct output
947 9

user output
947 9

Test 6

Group: 1, 2

Verdict: ACCEPTED

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

correct output
886 9

user output
886 9

Test 7

Group: 1, 2

Verdict: ACCEPTED

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

correct output
1287 400

user output
1287 400

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: ACCEPTED

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

correct output
999 999

user output
999 999

Test 11

Group: 1, 2

Verdict: ACCEPTED

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

correct output
999 999

user output
999 999

Test 12

Group: 2

Verdict:

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

correct output
10971 999

user output
(empty)

Test 13

Group: 2

Verdict: ACCEPTED

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

correct output
9999 999

user output
9999 999

Test 14

Group: 2

Verdict: ACCEPTED

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

correct output
18766 5000

user output
18766 5000

Test 15

Group: 2

Verdict: ACCEPTED

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

correct output
9999 9999

user output
9999 9999

Test 16

Group: 2

Verdict: ACCEPTED

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

correct output
9999 9999

user output
9999 9999

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: ACCEPTED

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

correct output
133765 3

user output
133765 3

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)