Robotti

input/code.c: In function 'main':
input/code.c:59:5: warning: ignoring return value of 'fgets' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |     fgets(jou, 100, stdin);
      |     ^~~~~~~~~~~~~~~~~~~~~~
input/code.c:63:5: warning: ignoring return value of 'fgets' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |     fgets(room_buffer, roomc+1, stdin);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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

long get_ri(const char* rooms, long max) {
    long pos = 0;
    for (long i = 0; i < max; i++) {
        if (rooms[i] == 'R') {
            pos = i;
            break;
        }
    }
    return pos;
}

void get_left_right(const char* rooms, long* leftP, long* rightP, long ri, long max) {
    *leftP = -1;
    *rightP = -1;

    for (long i = ri; i >= 0; i--) {
        if (rooms[i] == '*') {
            *leftP = i;
            break;
        }
    }

    for (long i = ri; i <= max; i++) {
        if (rooms[i] == '*') {
            *rightP = i;
            break;
        }
    }
}

void get_distance_lr(long leftP, long rightP, long* out_distanceL, long* out_distanceR, long ri) {
    if (leftP < 0) {
        *out_distanceL = -1;
    }
    else {
        *out_distanceL = ri - leftP;
    }
    
    if (rightP < 0) {
        *out_distanceR = -1;
    }
    else {
        *out_distanceR = rightP - ri;
    }
}

void move_to(char* rooms, long* ri, long to) {
    rooms[to] = '.';
    *ri = to;
}

int main() {
    char jou[100];
    fgets(jou, 100, stdin);

    long roomc = atol(jou);
    char room_buffer[200001];
    fgets(room_buffer, roomc+1, stdin);
    long robot_index = get_ri(room_buffer, roomc);
    long coins_collected = 0;
    long distance = 0;

    long leftP;
    long rightP;
    long distance_left;
    long distance_right;
loop:

    get_left_right(room_buffer, &leftP, &rightP, robot_index, roomc);
    if (leftP == -1 && rightP == -1) goto halt;

    get_distance_lr(leftP, rightP, &distance_left, &distance_right, robot_index);
    if (distance_left <= 0 || distance_left < distance_right) {
        goto move_right;
    }
    else if (distance_right <= 0 || distance_right < distance_left) {
        goto move_left;
    }
    else {
        goto halt;
    }

move_left:

    move_to(room_buffer, &robot_index, leftP);
    coins_collected++;
    distance = distance + distance_left;
    goto loop;

move_right:

    move_to(room_buffer, &robot_index, rightP);
    coins_collected++;
    distance = distance + distance_right;
    goto loop;

halt:

    printf("%li %li\n", distance, coins_collected);
    return 0;
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: WRONG ANSWER

Test 4

Group: 1, 2

Verdict: ACCEPTED

Test 5

Group: 1, 2

Verdict: ACCEPTED

Test 6

Group: 1, 2

Verdict: ACCEPTED

Test 7

Group: 1, 2

Verdict: WRONG ANSWER

Test 8

Group: 1, 2

Verdict: ACCEPTED

Test 9

Group: 1, 2

Verdict: ACCEPTED

Test 10

Group: 1, 2

Verdict: ACCEPTED

Test 11

Group: 1, 2

Verdict: ACCEPTED

Test 12

Group: 2

Verdict: WRONG ANSWER

Test 13

Group: 2

Verdict: ACCEPTED

Test 14

Group: 2

Verdict: WRONG ANSWER

Test 15

Group: 2

Verdict: ACCEPTED

Test 16

Group: 2

Verdict: ACCEPTED

Test 17

Group: 2

Verdict: ACCEPTED

Test 18

Group: 2

Verdict: WRONG ANSWER

Test 19

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 20

Group: 2

Verdict: ACCEPTED

Test 21

Group: 2

Verdict: ACCEPTED

Test 22

Group: 2

Verdict: ACCEPTED

Test 23

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 24

Group: 2

Verdict: TIME LIMIT EXCEEDED