CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:rottis
Submission time:2024-10-28 10:49:57 +0200
Language:C++ (C++17)
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED30
#2ACCEPTED70
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.00 s1, 2details
#8ACCEPTED0.00 s1, 2details
#9ACCEPTED0.00 s1, 2details
#10ACCEPTED0.00 s1, 2details
#11ACCEPTED0.00 s1, 2details
#12ACCEPTED0.00 s2details
#13ACCEPTED0.00 s2details
#14ACCEPTED0.00 s2details
#15ACCEPTED0.00 s2details
#16ACCEPTED0.00 s2details
#17ACCEPTED0.01 s2details
#18ACCEPTED0.01 s2details
#19ACCEPTED0.01 s2details
#20ACCEPTED0.01 s2details
#21ACCEPTED0.01 s2details
#22ACCEPTED0.01 s2details
#23ACCEPTED0.01 s2details
#24ACCEPTED0.01 s2details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:44:27: warning: 'robot_ptr' may be used uninitialized in this function [-Wmaybe-uninitialized]
   44 |     char *right_ptr = step(board, n, robot_ptr, RIGHT);
      |                       ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Code

#define LEFT -1
#define RIGHT 1
#include <iostream>
char* step(char* board, long n, char* robot, int dir) {
if (robot == nullptr) {
throw "you fucked it up idiot!!!";
}
while (robot >= board && robot < board + n*sizeof(char)) {
robot += dir*sizeof(char);
if (*robot == '*') {
return robot;
}
}
return nullptr;
}
void print_board(char* board, long n) {
for (int i = 0; i < n; i++) {
std::cout << board[i];
}
}
int main() {
long n;
std::cin >> n;
char *board = (char*) malloc((1+n) * sizeof(char));
std::cin >> board;
long long steps = 0;
long coins_collected = 0;
char *robot_ptr;
for (long i = 0; i < n; i++) {
if (board[i] == 'R') {
robot_ptr = board + i;
break;
}
}
char *left_ptr = step(board, n, robot_ptr, LEFT);
char *right_ptr = step(board, n, robot_ptr, RIGHT);
while (
!(left_ptr == nullptr && right_ptr == nullptr) && (
( // either but not both is null
left_ptr == nullptr || right_ptr == nullptr
) ||
( // both are not null and not in middle
(long)(right_ptr - board) + (long)(left_ptr - board)
!= 2*(long)(robot_ptr - board)
)
)
) {
//std::cout << (long)(left_ptr - board) << ' ' << (long)(robot_ptr - board) << ' ' << (long)(right_ptr - board) << '\n';
// closer to left?
if (
(
(robot_ptr - left_ptr < right_ptr - robot_ptr) && left_ptr != nullptr
) || right_ptr == nullptr
) {
// go left
steps += robot_ptr - left_ptr;
robot_ptr = left_ptr;
left_ptr = step(board, n, left_ptr, LEFT);
} else {
// go right
steps += right_ptr - robot_ptr;
robot_ptr = right_ptr;
right_ptr = step(board, n, right_ptr, RIGHT);
}
coins_collected++;
}
std::cout << steps << ' ' << coins_collected << std::endl;
return 0;
}

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

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

correct output
10971 999

user output
10971 999

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

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

correct output
299934 10000

user output
299934 10000

Test 19

Group: 2

Verdict: ACCEPTED

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

correct output
299998 100000

user output
299998 100000

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

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

correct output
199982 5000

user output
199982 5000

Test 23

Group: 2

Verdict: ACCEPTED

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

correct output
199999 199999

user output
199999 199999

Test 24

Group: 2

Verdict: ACCEPTED

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

correct output
199999 199999

user output
199999 199999