Task: | Robotti |
Sender: | hasorez |
Submission time: | 2024-11-01 18:18:40 +0200 |
Language: | C |
Status: | READY |
Result: | 30 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 30 |
#2 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.00 s | 1, 2 | details |
#2 | ACCEPTED | 0.00 s | 1, 2 | details |
#3 | ACCEPTED | 0.00 s | 1, 2 | details |
#4 | ACCEPTED | 0.00 s | 1, 2 | details |
#5 | ACCEPTED | 0.00 s | 1, 2 | details |
#6 | ACCEPTED | 0.00 s | 1, 2 | details |
#7 | ACCEPTED | 0.00 s | 1, 2 | details |
#8 | ACCEPTED | 0.00 s | 1, 2 | details |
#9 | ACCEPTED | 0.00 s | 1, 2 | details |
#10 | ACCEPTED | 0.00 s | 1, 2 | details |
#11 | ACCEPTED | 0.00 s | 1, 2 | details |
#12 | ACCEPTED | 0.00 s | 2 | details |
#13 | ACCEPTED | 0.00 s | 2 | details |
#14 | ACCEPTED | 0.00 s | 2 | details |
#15 | ACCEPTED | 0.01 s | 2 | details |
#16 | ACCEPTED | 0.01 s | 2 | details |
#17 | ACCEPTED | 0.00 s | 2 | details |
#18 | ACCEPTED | 0.10 s | 2 | details |
#19 | TIME LIMIT EXCEEDED | -- | 2 | details |
#20 | ACCEPTED | 0.00 s | 2 | details |
#21 | ACCEPTED | 0.00 s | 2 | details |
#22 | ACCEPTED | 0.04 s | 2 | details |
#23 | TIME LIMIT EXCEEDED | -- | 2 | details |
#24 | TIME LIMIT EXCEEDED | -- | 2 | details |
Compiler report
input/code.c: In function 'main': input/code.c:44:11: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result] 44 | (void)scanf("%d", &huoneiden_määrä); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ input/code.c:53:5: warning: ignoring return value of 'fgets' declared with attribute 'warn_unused_result' [-Wunused-result] 53 | fgets(mappi, huoneiden_määrä+1, stdin); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Code
#include <stdio.h> #include <time.h> #include <string.h> #include <stdlib.h> //#include <stddef.h> static inline int lähin_kolikkohuone(char *mappi, int robottihuone_idx, int huoneiden_määrä) { 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, '*'); //char *vasen_lähin = (char*)memchr(mappi_vasen, '*', robottihuone_idx); int vasen_lähin_idx = (vasen_lähin) ? (vasen_lähin - mappi_vasen): 1000002; //char mappi_oikea[huoneiden_määrä-robottihuone_idx+1]; //strncpy(mappi_oikea, mappi+robottihuone_idx+1, huoneiden_määrä-robottihuone_idx); //mappi_oikea[huoneiden_määrä-robottihuone_idx] = '\0'; //char *oikea_lähin = (char*)memchr(mappi_oikea, '*', huoneiden_määrä-robottihuone_idx); char *oikea_lähin = (char*)memchr(mappi+robottihuone_idx+1, '*', huoneiden_määrä-robottihuone_idx); /*printf("mappi_oikea: %s\n", mappi_oikea); printf("mappi + jotain: %s\n", mappi+robottihuone_idx+1); if (oikea_lähin==oikea_lähinnn) { printf("Samat ovat!"); } else { printf("Eri ovat! %d ja %d\n", (oikea_lähin-mappi_oikea)+robottihuone_idx+1, oikea_lähinnn-mappi); }*/ //int oikea_lähin_idx = (oikea_lähin) ? ((oikea_lähin - mappi_oikea)+robottihuone_idx+1): 1000002; int oikea_lähin_idx = (oikea_lähin) ? (oikea_lähin - mappi): 1000002; 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ä; (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ä); 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: TIME LIMIT EXCEEDED
input |
---|
200000 **.***....**..**.....***.*..*.... |
correct output |
---|
299998 100000 |
user output |
---|
(empty) |
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: TIME LIMIT EXCEEDED
input |
---|
200000 R*****************************... |
correct output |
---|
199999 199999 |
user output |
---|
(empty) |
Test 24
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 ******************************... |
correct output |
---|
199999 199999 |
user output |
---|
(empty) |