CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:hasorez
Submission time:2024-11-02 09:37:59 +0200
Language:C
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED30
#2ACCEPTED70
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
#7ACCEPTED0.00 s1, 2details
#8ACCEPTED0.00 s1, 2details
#9ACCEPTED0.00 s1, 2details
#10ACCEPTED0.00 s1, 2details
#11ACCEPTED0.00 s1, 2details
#12ACCEPTED0.00 s2details
#13ACCEPTED0.00 s2details
#14ACCEPTED0.00 s2details
#15ACCEPTED0.00 s2details
#16ACCEPTED0.00 s2details
#17ACCEPTED0.00 s2details
#18ACCEPTED0.00 s2details
#19ACCEPTED0.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:80:11: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   80 |     (void)scanf("%d", &huoneiden_määrä);
      |           ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.c:89:5: warning: ignoring return value of 'fgets' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |     fgets(mappi, huoneiden_määrä+1, stdin);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Code

#include <stdio.h>
#include <time.h>
#include <string.h>
#include <stdlib.h>
static inline int lähin_kolikkohuone(char *mappi, int robottihuone_idx, int huoneiden_määrä, char *e_right, char *e_left) {
/*int vasen_lähin_idx = 1000002;
if (*e_left == 1) {
char mappi_vasen[robottihuone_idx+2];
strncpy(mappi_vasen, mappi, robottihuone_idx+1);
mappi_vasen[robottihuone_idx + 1] = '\0';
char *vasen_lähin = strrchr(mappi_vasen, '*');
if (vasen_lähin) {
vasen_lähin_idx = vasen_lähin-mappi_vasen;
} else {
*e_left = 0;
}
}
int oikea_lähin_idx = 1000002;
if (*e_right == 1) {
char *oikea_lähin = (char*)memchr(mappi+robottihuone_idx+1, '*', huoneiden_määrä-robottihuone_idx);
if (oikea_lähin) {
oikea_lähin_idx = oikea_lähin-mappi;
} else {
*e_right = 0;
}
}*/
int vasen_lähin_idx = 1000002;
int oikea_lähin_idx = 1000002;
int counter = 1;
char break_loop = 0;
while (1) {
if ((robottihuone_idx-counter)>=0) {
if (mappi[robottihuone_idx-counter] == '*') {
break_loop = 1;
vasen_lähin_idx = robottihuone_idx-counter;
}
}
if ((robottihuone_idx+counter)<=huoneiden_määrä) {
if (mappi[robottihuone_idx+counter] == '*') {
break_loop = 1;
oikea_lähin_idx = robottihuone_idx+counter;
}
}
counter++;
if (break_loop == 1 || ((robottihuone_idx-counter<0) && (robottihuone_idx+counter>huoneiden_määrä))) {
break;
}
}
/*if (vasen_lähin_idx_test == vasen_lähin_idx) {
printf("Ovat samat!\n");
} else {
printf("Ovat eri! %d ja %d\n", vasen_lähin_idx_test, vasen_lähin_idx);
}
if (oikea_lähin_idx_test == oikea_lähin_idx) {
printf("Ovat samat!\n");
} else {
printf("Ovat eri! %d ja %d\n", oikea_lähin_idx_test, oikea_lähin_idx);
}*/
int vasen_lähin_dist = abs(vasen_lähin_idx-robottihuone_idx);
int oikea_lähin_dist = abs(oikea_lähin_idx-robottihuone_idx);
if (oikea_lähin_dist == vasen_lähin_dist) {
return -1;
}
return (oikea_lähin_dist < vasen_lähin_dist) ? oikea_lähin_idx : vasen_lähin_idx;
}
int main () {
int askeleet = 0;
int kolikot = 0;
int huoneiden_määrä;
char *e_right = &(char){1};
char *e_left = &(char){1};
(void)scanf("%d", &huoneiden_määrä);
int c;
do{
c = getchar();
}while(c != EOF && c != '\n');
//FILE *fptr;
//fptr = fopen("output.txt", "r");
char mappi[huoneiden_määrä+2];
//fgets(mappi, huoneiden_määrä+1, fptr);
fgets(mappi, huoneiden_määrä+1, stdin);
mappi[huoneiden_määrä + 2] = '\0';
//clock_t tic = clock();
int robottihuone_idx, kolikkohuone_idx;
robottihuone_idx = (int)((char*)memchr(mappi, 'R', huoneiden_määrä+1)-mappi);
mappi[robottihuone_idx] = '.';
while (1) {
kolikkohuone_idx = lähin_kolikkohuone(mappi, robottihuone_idx, huoneiden_määrä, e_right, e_left);
if (kolikkohuone_idx == -1) {
break;
}
askeleet = askeleet + abs(kolikkohuone_idx-robottihuone_idx);
kolikot = kolikot +1;
mappi[kolikkohuone_idx] = '.';
robottihuone_idx = kolikkohuone_idx;
}
printf("%d %d\n", askeleet, kolikot);
//clock_t toc = clock();
//printf("Elapsed: %f seconds\n", (double)(toc - tic) / CLOCKS_PER_SEC);
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: ACCEPTED

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

correct output
1287 400

user output
1287 400

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

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

correct output
10971 999

user output
10971 999

Test 13

Group: 2

Verdict: ACCEPTED

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

correct output
9999 999

user output
9999 999

Test 14

Group: 2

Verdict: ACCEPTED

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

correct output
18766 5000

user output
18766 5000

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

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

correct output
299934 10000

user output
299934 10000

Test 19

Group: 2

Verdict: ACCEPTED

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

correct output
299998 100000

user output
299998 100000

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