CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:pyry0
Submission time:2024-10-30 16:08:57 +0200
Language:C
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2details
#2ACCEPTED0.00 s1, 2details
#3ACCEPTED0.00 s1, 2details
#4ACCEPTED0.00 s1, 2details
#5ACCEPTED0.00 s1, 2details
#6ACCEPTED0.00 s1, 2details
#70.00 s1, 2details
#8ACCEPTED0.00 s1, 2details
#9ACCEPTED0.00 s1, 2details
#10ACCEPTED0.00 s1, 2details
#11ACCEPTED0.00 s1, 2details
#120.00 s2details
#13ACCEPTED0.00 s2details
#140.00 s2details
#15ACCEPTED0.00 s2details
#16ACCEPTED0.00 s2details
#17ACCEPTED0.00 s2details
#180.00 s2details
#190.01 s2details
#20ACCEPTED0.00 s2details
#21ACCEPTED0.00 s2details
#22ACCEPTED0.00 s2details
#23ACCEPTED0.00 s2details
#24ACCEPTED0.00 s2details

Compiler report

input/code.c: In function 'main':
input/code.c:7:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 |     scanf("%d\r%s", &n, buf);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~
input/code.c:12:9: warning: 'r' may be used uninitialized in this function [-Wmaybe-uninitialized]
   12 |     int r;
      |         ^

Code

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

int main(void) {
    char *buf = malloc(200000);
    int n;
    scanf("%d\r%s", &n, buf);
    int *l_poss = malloc(sizeof(int) * (n - 1));
    int *r_poss = malloc(sizeof(int) * (n - 1));
    int l_pos_i = 0;
    int r_pos_i = 0;
    int r;
    for (int i = 0; i < n; ++i) {
        if (buf[i] == '*') {
            l_poss[l_pos_i++] = i;
        } else if (buf[i] == 'R') {
            r = i;
            break;
        }
    }
    for (int i = r; i < n; ++i) {
        if (buf[i] == '*') {
            r_poss[r_pos_i++] = i;
        }
    }
    free(buf);
    int steps = 0;
    int coins = 0;
    int stupid = 0;
    while (l_pos_i != 0 || stupid != r_pos_i) {
        if (l_pos_i == 0) {
            steps += r_poss[r_pos_i - 1];
            coins += r_pos_i;
            break;
        } else if (r_pos_i == 0) {
            steps += r - l_poss[0];
            coins += l_pos_i;
            break;
        } else {
            int l_dist = r - l_poss[l_pos_i - 1];
            int r_dist = r_poss[stupid] - r;
            if (l_dist < r_dist) {
                r = l_poss[l_pos_i - 1];
                --l_pos_i;
                steps += l_dist;
                ++coins;
            } else if (r_dist < l_dist) {
                r = r_poss[stupid];
                ++stupid;
                steps += r_dist;
                ++coins;
            } else {
                break;
            }
        }
    }
    free(l_poss);
    free(r_poss);
    printf("%d %d\n", steps, coins);
    return 0;
}

Test details

Test 1

Group: 1, 2

Verdict: ACCEPTED

input
1
R

correct output
0 0

user output
0 0

Test 2

Group: 1, 2

Verdict: ACCEPTED

input
10
...R......

correct output
0 0

user output
0 0

Test 3

Group: 1, 2

Verdict: ACCEPTED

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

correct output
12 5

user output
12 5

Test 4

Group: 1, 2

Verdict: ACCEPTED

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

correct output
0 0

user output
0 0

Test 5

Group: 1, 2

Verdict: ACCEPTED

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

correct output
947 9

user output
947 9

Test 6

Group: 1, 2

Verdict: ACCEPTED

input
1000
.................................

correct output
886 9

user output
886 9

Test 7

Group: 1, 2

Verdict:

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

correct output
1287 400

user output
-193751 799

Test 8

Group: 1, 2

Verdict: ACCEPTED

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

correct output
0 0

user output
0 0

Test 9

Group: 1, 2

Verdict: ACCEPTED

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

correct output
0 0

user output
0 0

Test 10

Group: 1, 2

Verdict: ACCEPTED

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

correct output
999 999

user output
999 999

Test 11

Group: 1, 2

Verdict: ACCEPTED

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

correct output
999 999

user output
999 999

Test 12

Group: 2

Verdict:

input
10000
.......**........*...........*...

correct output
10971 999

user output
10978 1000

Test 13

Group: 2

Verdict: ACCEPTED

input
10000
*..*....*......*.....*..*........

correct output
9999 999

user output
9999 999

Test 14

Group: 2

Verdict:

input
10000
*.*.*...**.*...*....**.**.**.....

correct output
18766 5000

user output
-818480 5656

Test 15

Group: 2

Verdict: ACCEPTED

input
10000
R*****************************...

correct output
9999 9999

user output
9999 9999

Test 16

Group: 2

Verdict: ACCEPTED

input
10000
******************************...

correct output
9999 9999

user output
9999 9999

Test 17

Group: 2

Verdict: ACCEPTED

input
200000
.................................

correct output
0 0

user output
0 0

Test 18

Group: 2

Verdict:

input
200000
.................................

correct output
299934 10000

user output
299979 10002

Test 19

Group: 2

Verdict:

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

correct output
299998 100000

user output
-700077398 149959

Test 20

Group: 2

Verdict: ACCEPTED

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

correct output
0 0

user output
0 0

Test 21

Group: 2

Verdict: ACCEPTED

input
200000
R................................

correct output
133765 3

user output
133765 3

Test 22

Group: 2

Verdict: ACCEPTED

input
200000
R................................

correct output
199982 5000

user output
199982 5000

Test 23

Group: 2

Verdict: ACCEPTED

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

correct output
199999 199999

user output
199999 199999

Test 24

Group: 2

Verdict: ACCEPTED

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

correct output
199999 199999

user output
199999 199999