CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:TNT
Submission time:2024-10-30 21:25:53 +0200
Language:C++ (C++17)
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.01 s1, 2details
#8ACCEPTED0.00 s1, 2details
#9ACCEPTED0.00 s1, 2details
#100.00 s1, 2details
#110.01 s1, 2details
#120.00 s2details
#130.04 s2details
#140.00 s2details
#150.00 s2details
#160.00 s2details
#17ACCEPTED0.01 s2details
#180.00 s2details
#190.00 s2details
#20ACCEPTED0.01 s2details
#210.00 s2details
#220.00 s2details
#230.01 s2details
#240.00 s2details

Compiler report

input/code.cpp: In function 'std::vector<int> CollectCoins(int, std::string, std::vector<int>)':
input/code.cpp:16:54: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   16 |         if (DistanceLeft==DistanceRight || (CoinLeft == -1) && (CoinRight == -1)) {
      |                                             ~~~~~~~~~^~~~~
input/code.cpp:16:75: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   16 |         if (DistanceLeft==DistanceRight || (CoinLeft == -1) && (CoinRight == -1)) {
      |                                                                 ~~~~~~~~~~^~~~~
input/code.cpp:16:61: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   16 |         if (DistanceLeft==DistanceRight || (CoinLeft == -1) && (CoinRight == -1)) {
      |                                            ~~~~~~~~~~~~~~~~...

Code

#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 = Layout.find_last_of("*", CurRobot);
	std::size_t DistanceLeft = CurRobot - CoinLeft;

	// Distance to the first coin right
	std::size_t CoinRight = Layout.find_first_of("*", CurRobot);
	std::size_t DistanceRight = CoinRight - CurRobot;

	if (DistanceLeft==DistanceRight || (CoinLeft == -1) && (CoinRight == -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:

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

Test 7

Group: 1, 2

Verdict:

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

correct output
1287 400

user output
.....*..*....**..**..*......*....

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 0

Test 11

Group: 1, 2

Verdict:

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

correct output
999 999

user output
******************************...

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
*..*....*......*.....*..*........

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

Test 16

Group: 2

Verdict:

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

correct output
9999 9999

user output
(empty)

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

Test 24

Group: 2

Verdict:

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

correct output
199999 199999

user output
(empty)