Robotti

input/code.c: In function 'get_ri':
input/code.c:40:1: warning: control reaches end of non-void function [-Wreturn-type]
   40 | }
      | ^
input/code.c: In function 'main':
input/code.c:55:3: warning: ignoring return value of 'fgets' declared with attribute 'warn_unused_result' [-Wunused-result]
   55 |   fgets(jou, 1024, stdin);
      |   ^~~~~~~~~~~~~~~~~~~~~~~
input/code.c:59:3: warning: ignoring return value of 'fgets' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |   fgets(room_layout, roomc+1, stdin);
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.c:61:8: warning: 'ri' is used uninitialized [-Wuninitialized]
   61 |   ri = get_ri(room_layout, ri);
      |        ^~~~~~~~~~~~~~~~~~~~~~~

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

void set_ptrs(const char* rooms, long int* ns,long int* fs, long int ri, long int* distl, long int* distf) {
  *ns = -1;
  *fs = -1;

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

  for (long int i = ri; i <= strlen(rooms); i++) {
    if (rooms[i] == '*') {
      *fs = i;
      break;
    }
  }

	if (*ns != -1 && *fs != -1) {
		*distl = ri - *ns;
		*distf = *fs - ri;
	}
	else if (*ns == -1) {
		*distl = strlen(rooms)+1;
	} else {
		*distf = strlen(rooms)+1;
	}
}

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

int main(int argc, char* argv[]) {
  
  long int roomc;
  char* room_layout;
  long int ns;
  long int fs;
  long int ri;
  char jou[1024];
  int coin_count = 0;
  int step_count = 0;
	long int distl;
	long int distf;
  
  fgets(jou, 1024, stdin);
  roomc = atoi(jou);

  room_layout = malloc(roomc+1);
  fgets(room_layout, roomc+1, stdin);

  ri = get_ri(room_layout, ri);

loop:

  set_ptrs(room_layout, &ns, &fs, ri, &distl, &distf);

    if (distl < distf) {
      room_layout[ri] = '.';
      room_layout[ns] = 'R';

      ri = ns;
      coin_count++;
      step_count = step_count + distl;
    }
    else if (distf < distl){
      room_layout[ri] = '.';
      room_layout[fs] = 'R';
      ri = fs;
      coin_count++;
      step_count = step_count + distf;
    } else {
			goto halt;
		}
		
	goto loop;

halt:
  printf("%i %i\n", step_count, coin_count);

  return 0;
}

Test 1

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 2

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 1, 2

Verdict: ACCEPTED

Test 5

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 1, 2

Verdict: WRONG ANSWER

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: TIME LIMIT EXCEEDED

Test 11

Group: 1, 2

Verdict: WRONG ANSWER

Test 12

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 2

Verdict: WRONG ANSWER

Test 14

Group: 2

Verdict: WRONG ANSWER

Test 15

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 2

Verdict: WRONG ANSWER

Test 17

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 18

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 19

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 20

Group: 2

Verdict: ACCEPTED

Test 21

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 22

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 23

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 24

Group: 2

Verdict: TIME LIMIT EXCEEDED