CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:osmukka
Submission time:2024-11-06 10:33:41 +0200
Language:C
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#10.05 s1, 2details
#20.05 s1, 2details
#30.05 s1, 2details
#40.05 s1, 2details
#50.05 s1, 2details
#60.05 s1, 2details
#70.05 s1, 2details
#80.05 s1, 2details
#90.05 s1, 2details
#100.05 s1, 2details
#110.05 s1, 2details
#120.06 s2details
#130.06 s2details
#140.06 s2details
#150.06 s2details
#160.06 s2details
#170.28 s2details
#180.28 s2details
#190.28 s2details
#200.28 s2details
#210.28 s2details
#220.28 s2details
#230.28 s2details
#240.28 s2details

Code

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>


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 -1.
    return -1;
}


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;
        }
    }
    // Distance cant be negative.
    return -1;
}


int main()
{
    char ch;
    int number_index = 0;
    char amount_str[7] = {0, 0, 0, 0, 0, 0, 0};
    int amount = 0;

    while(read(STDIN_FILENO, &ch, 1) > 0)
    {
        amount_str[number_index] = ch;
    }
    amount = atoi(amount_str);

    char* rooms = malloc(sizeof(char)*amount);
    if(read(STDIN_FILENO, &rooms, 1) <= 0)
    {
        printf("error\n");
    }

    int robot_index = 0;
    int steps = 0;
    int coins = 0;

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

    int d_left  = distance_left(rooms, robot_index);
    int d_right = distance_right(rooms, robot_index, amount);

    while(1)
    {
        if(d_left == 0)
            d_left = distance_left(rooms, robot_index);
        else if(d_right == 0)
            d_right = distance_right(rooms, robot_index, amount);

        if(d_left < d_right)
        {
            rooms[robot_index] = '.';
            robot_index--;
            rooms[robot_index] = 'R';
            steps += d_left;

            d_right += d_left;
            coins++;
            d_left = 0;
        }
        else if(d_right < d_left)
        {
            rooms[robot_index] = '.';
            robot_index++;
            rooms[robot_index] = 'R';

            steps += d_right;
            coins++;
            d_right = 0;
        }
        else
        {
            break;
        }
    }
 
    printf("%d %d", steps, coins);
    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
(empty)

Test 4

Group: 1, 2

Verdict:

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

correct output
0 0

user output
(empty)

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
(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
(empty)

Test 9

Group: 1, 2

Verdict:

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

correct output
0 0

user output
(empty)

Test 10

Group: 1, 2

Verdict:

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

correct output
999 999

user output
(empty)

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
(empty)

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
(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
(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
(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
(empty)

Test 24

Group: 2

Verdict:

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

correct output
199999 199999

user output
(empty)