Task: | Robotti |
Sender: | hasorez |
Submission time: | 2024-10-30 20:56:15 +0200 |
Language: | C |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | RUNTIME ERROR | 0 |
#2 | RUNTIME ERROR | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | RUNTIME ERROR | 0.00 s | 1, 2 | details |
#2 | ACCEPTED | 0.00 s | 1, 2 | details |
#3 | WRONG ANSWER | 0.00 s | 1, 2 | details |
#4 | ACCEPTED | 0.00 s | 1, 2 | details |
#5 | ACCEPTED | 0.00 s | 1, 2 | details |
#6 | RUNTIME ERROR | 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 | WRONG ANSWER | 0.00 s | 1, 2 | details |
#11 | RUNTIME ERROR | 0.00 s | 1, 2 | details |
#12 | ACCEPTED | 0.00 s | 2 | details |
#13 | RUNTIME ERROR | 0.00 s | 2 | details |
#14 | ACCEPTED | 0.01 s | 2 | details |
#15 | WRONG ANSWER | 0.01 s | 2 | details |
#16 | RUNTIME ERROR | 0.00 s | 2 | details |
#17 | ACCEPTED | 0.00 s | 2 | details |
#18 | ACCEPTED | 0.34 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.09 s | 2 | details |
#23 | TIME LIMIT EXCEEDED | -- | 2 | details |
#24 | RUNTIME ERROR | 0.00 s | 2 | details |
Compiler report
input/code.c: In function 'main': input/code.c:75:11: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result] 75 | (void)scanf("%d", &huoneiden_määrä); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ input/code.c:82:5: warning: ignoring return value of 'fgets' declared with attribute 'warn_unused_result' [-Wunused-result] 82 | fgets(mappi, huoneiden_määrä, stdin); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Code
#include <stdio.h>#include <string.h>#include <stdlib.h>int lähin_kolikkohuone(char *mappi, int robottihuone_idx, int huoneiden_määrä) {char *mappi_vasen = (char*)malloc((robottihuone_idx+2) * sizeof(*mappi_vasen));strncpy(mappi_vasen, mappi, robottihuone_idx+1);mappi_vasen[robottihuone_idx + 1] = '\0';//printf("mappi vasen: %s\n", mappi_vasen);char *vasen_lähin = strrchr(mappi_vasen, '*');int vasen_lähin_idx;if (vasen_lähin) {vasen_lähin_idx = vasen_lähin - mappi_vasen;} else {vasen_lähin_idx = -1;}char *mappi_oikea = (char*)malloc((huoneiden_määrä-robottihuone_idx+1)*sizeof(*mappi));strncpy(mappi_oikea, mappi+robottihuone_idx+1, huoneiden_määrä-robottihuone_idx);mappi_oikea[huoneiden_määrä-robottihuone_idx] = '\0';//printf("mappi oikea: %s\n", mappi_oikea);char *oikea_lähin = strchr(mappi_oikea, '*');int oikea_lähin_idx;if (oikea_lähin) {oikea_lähin_idx = (oikea_lähin - mappi_oikea)+robottihuone_idx+1;} else {oikea_lähin_idx = -1;}//printf("Vasen: %s\n", mappi_vasen);//printf("Oikea: %s\n", mappi_oikea);free(mappi_vasen);//printf("vasen vapautettu\n");free(mappi_oikea);//printf("Oikea vapautettu\n");int vasen_lähin_dist, oikea_lähin_dist;if (vasen_lähin_idx > -1) {vasen_lähin_dist = abs(vasen_lähin_idx-robottihuone_idx);} else {vasen_lähin_dist = -1;}if (oikea_lähin_idx > -1) {oikea_lähin_dist = abs(oikea_lähin_idx-robottihuone_idx);} else {oikea_lähin_dist = -1;}if ((oikea_lähin_dist != -1) && (vasen_lähin_dist != -1)) {if (oikea_lähin_dist == vasen_lähin_dist) {return -1;}if (oikea_lähin_dist < vasen_lähin_dist) {return oikea_lähin_idx;}else {return vasen_lähin_idx;}}if ((oikea_lähin_dist != -1) && (vasen_lähin_dist == -1)) {return oikea_lähin_idx;}if ((vasen_lähin_dist != -1) && (oikea_lähin_dist == -1)) {return vasen_lähin_idx;}return -1;}int main () {unsigned int askeleet, kolikot;int huoneiden_määrä;(void)scanf("%d", &huoneiden_määrä);int c;do{c = getchar();}while(c != EOF && c != '\n');char *mappi = (char*)malloc((huoneiden_määrä + 1) * sizeof(*mappi));//(void)scanf_s("%s", mappi, huoneiden_määrä);fgets(mappi, huoneiden_määrä, stdin);char *robottihuone;int robottihuone_idx, kolikkohuone_idx;kolikot = 0;askeleet = 0;while (1) {robottihuone = strchr(mappi, 'R');robottihuone_idx = (int)(robottihuone-mappi);kolikkohuone_idx = lähin_kolikkohuone(mappi, robottihuone_idx, huoneiden_määrä);if (kolikkohuone_idx == -1) {break;}askeleet = askeleet + abs(kolikkohuone_idx-robottihuone_idx);kolikot++;mappi[robottihuone_idx] = '.';mappi[kolikkohuone_idx] = 'R';// Debugging output to trace mappi after each step//printf("After move: %s\n", mappi);// printf("Steps: %d, Coins: %d\n", askeleet, kolikot);}printf("%d %d\n", askeleet, kolikot);free(mappi);return 0;}
Test details
Test 1
Group: 1, 2
Verdict: RUNTIME ERROR
input |
---|
1 R |
correct output |
---|
0 0 |
user output |
---|
(empty) |
Test 2
Group: 1, 2
Verdict: ACCEPTED
input |
---|
10 ...R...... |
correct output |
---|
0 0 |
user output |
---|
0 0 |
Test 3
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
10 **.R...*** |
correct output |
---|
12 5 |
user output |
---|
11 4 |
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: RUNTIME ERROR
input |
---|
1000 ................................. |
correct output |
---|
886 9 |
user output |
---|
(empty) |
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: WRONG ANSWER
input |
---|
1000 R*****************************... |
correct output |
---|
999 999 |
user output |
---|
998 998 |
Test 11
Group: 1, 2
Verdict: RUNTIME ERROR
input |
---|
1000 ******************************... |
correct output |
---|
999 999 |
user output |
---|
(empty) |
Test 12
Group: 2
Verdict: ACCEPTED
input |
---|
10000 .......**........*...........*... |
correct output |
---|
10971 999 |
user output |
---|
10971 999 |
Test 13
Group: 2
Verdict: RUNTIME ERROR
input |
---|
10000 *..*....*......*.....*..*........ |
correct output |
---|
9999 999 |
user output |
---|
(empty) |
Test 14
Group: 2
Verdict: ACCEPTED
input |
---|
10000 *.*.*...**.*...*....**.**.**..... |
correct output |
---|
18766 5000 |
user output |
---|
18766 5000 |
Test 15
Group: 2
Verdict: WRONG ANSWER
input |
---|
10000 R*****************************... |
correct output |
---|
9999 9999 |
user output |
---|
9998 9998 |
Test 16
Group: 2
Verdict: RUNTIME ERROR
input |
---|
10000 ******************************... |
correct output |
---|
9999 9999 |
user output |
---|
(empty) |
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: RUNTIME ERROR
input |
---|
200000 ******************************... |
correct output |
---|
199999 199999 |
user output |
---|
(empty) |