Robotti

input/code.c: In function 'main':
input/code.c:50:5: warning: ignoring return value of 'read' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |     read(STDIN_FILENO, &rooms, 1);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

#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);
    read(STDIN_FILENO, &rooms, 1);

    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 1

Group: 1, 2

Verdict: RUNTIME ERROR

Test 2

Group: 1, 2

Verdict: RUNTIME ERROR

Test 3

Group: 1, 2

Verdict: RUNTIME ERROR

Test 4

Group: 1, 2

Verdict: RUNTIME ERROR

Test 5

Group: 1, 2

Verdict: RUNTIME ERROR

Test 6

Group: 1, 2

Verdict: RUNTIME ERROR

Test 7

Group: 1, 2

Verdict: RUNTIME ERROR

Test 8

Group: 1, 2

Verdict: RUNTIME ERROR

Test 9

Group: 1, 2

Verdict: RUNTIME ERROR

Test 10

Group: 1, 2

Verdict: RUNTIME ERROR

Test 11

Group: 1, 2

Verdict: RUNTIME ERROR

Test 12

Group: 2

Verdict: RUNTIME ERROR

Test 13

Group: 2

Verdict: RUNTIME ERROR

Test 14

Group: 2

Verdict: RUNTIME ERROR

Test 15

Group: 2

Verdict: RUNTIME ERROR

Test 16

Group: 2

Verdict: RUNTIME ERROR

Test 17

Group: 2

Verdict: RUNTIME ERROR

Test 18

Group: 2

Verdict: RUNTIME ERROR

Test 19

Group: 2

Verdict: RUNTIME ERROR

Test 20

Group: 2

Verdict: RUNTIME ERROR

Test 21

Group: 2

Verdict: RUNTIME ERROR

Test 22

Group: 2

Verdict: RUNTIME ERROR

Test 23

Group: 2

Verdict: RUNTIME ERROR

Test 24

Group: 2

Verdict: RUNTIME ERROR