CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:osmukka
Submission time:2024-11-06 10:05:43 +0200
Language:C++ (C++17)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#1--1, 2details
#2--1, 2details
#30.01 s1, 2details
#40.00 s1, 2details
#50.00 s1, 2details
#6--1, 2details
#7--1, 2details
#80.00 s1, 2details
#90.00 s1, 2details
#100.00 s1, 2details
#11--1, 2details
#120.00 s2details
#13--2details
#140.00 s2details
#150.00 s2details
#16--2details
#17--2details
#18--2details
#19--2details
#20--2details
#210.01 s2details
#220.01 s2details
#230.01 s2details
#24--2details

Code

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


int distance_left(char* array, int robot_index)
{

    for(int i = robot_index-1; i >= 0; i--)
    {
        if(array[i] == '*')
        {
            return robot_index - i;
        }
    }
    // If no coins exist to the left. Distance between two indices can't be 0.
    return 0;
}


int distance_right(char* array, int robot_index, const int array_len)
{
    for(int i = array_len-robot_index; i <= array_len; i--)
    {
        if(array[i] == '*')
        {
            return i - robot_index;
        }
    }
    // If no coins exist to the left.
    return 0;
}


int main()
{
    int amount = 0;
    char rooms[300000];
    int robot_index = 0;
    int steps = 0;
    int coins = 0;
 
    std::cin >> amount;
    std::cin >> rooms;

    for(int i = 0; i < amount; i++)
    {
        if(rooms[i] == 'R')
        {
            robot_index = i;
            break;
        }
    }

    int d_left;
    int d_right;
    while(1)
    {
        d_left  = distance_left(rooms, robot_index);
        d_right = distance_right(rooms, robot_index, amount);
 
        if(d_left < d_right)
        {
            steps += d_left;
            rooms[robot_index] = '.';
            robot_index--;
            rooms[robot_index] = 'R';
            coins++;
        }
        else if(d_right < d_left)
        {
            steps += d_right;
            rooms[robot_index] = '.';
            robot_index++;
            rooms[robot_index] = 'R';
            coins++;
        }
        else if(d_left == d_right)
        {
            break;
        }
    }
 
    std::cout << steps << " " << coins << "\n";
    return 0;
}
 

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

Test 4

Group: 1, 2

Verdict:

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

correct output
0 0

user output
3 4

Test 5

Group: 1, 2

Verdict:

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

correct output
947 9

user output
0 1

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:

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

correct output
0 0

user output
345 315

Test 9

Group: 1, 2

Verdict:

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

correct output
0 0

user output
314 315

Test 10

Group: 1, 2

Verdict:

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

correct output
999 999

user output
0 1

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
11000 1000

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
2288 1235

Test 15

Group: 2

Verdict:

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

correct output
9999 9999

user output
0 1

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:

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

correct output
0 0

user output
(empty)

Test 21

Group: 2

Verdict:

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

correct output
133765 3

user output
0 1

Test 22

Group: 2

Verdict:

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

correct output
199982 5000

user output
0 1

Test 23

Group: 2

Verdict:

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

correct output
199999 199999

user output
0 1

Test 24

Group: 2

Verdict:

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

correct output
199999 199999

user output
(empty)