Robotti

input/code.c: In function 'main':
input/code.c:10:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     scanf("%i\n%s", &n, buf);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
 
// Koodin ei tarvinnut olla hyvää ja turvallista, eihän? :D
 
int main(void) {
    int n;
    char *buf = malloc(200000);
    scanf("%i\n%s", &n, buf);
    int r;
    for (int i = 0;; ++i) if (buf[i] == 'R') {
        r = i;
        break;
    }
    int steps = 0;
    int coins = 0;
    while (1) {
        if (r == 0) {
            int distr = 0;
            for (int i = r; i < n; ++i) {
                if (buf[i] == '*') {
                    r += distr;
                    steps += distr;
                    ++coins;
                    buf[r] = '.';
                    distr = 0;
                }
                ++distr;
            }
            goto end;
        } else if (r == n - 1) {
            int distl = 0;
            for (int i = r; i >= 0; --i) {
                if (buf[i] == '*') {
                    r -= distl;
                    steps += distl;
                    ++coins;
                    buf[r] = '.';
                    distl = 0;
                }
                ++distl;
            }
            goto end;
        } else {
            int found = 0;
            int distr = 0;
            for (int i = r; i < n; ++i) {
                if (buf[i] == '*') {
                    ++found;
                    break;
                }
                ++distr;
            }
            int distl = 0;
            for (int i = r; i >= 0; --i) {
                if (buf[i] == '*') {
                    ++found;
                    break;
                }
                ++distl;
            }
            if (found == 0) goto end;
            if (distr < distl) {
                r += distr;
                steps += distr;
                ++coins;
                buf[r] = '.';
            } else if (distl < distr) {
                r -= distl;
                steps += distl;
                ++coins;
                buf[r] = '.';
            } else {
                goto end;
            }
        }
    }
end:
    printf("%i %i\n", steps, coins);
    free(buf);
    return 0;
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: ACCEPTED

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

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

Test 13

Group: 2

Verdict: ACCEPTED

Test 14

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 2

Verdict: ACCEPTED

Test 16

Group: 2

Verdict: ACCEPTED

Test 17

Group: 2

Verdict: ACCEPTED

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: ACCEPTED

Test 22

Group: 2

Verdict: ACCEPTED

Test 23

Group: 2

Verdict: ACCEPTED

Test 24

Group: 2

Verdict: ACCEPTED