Task: | Robotti |
Sender: | -=SharpS=- |
Submission time: | 2024-10-28 18:39:27 +0200 |
Language: | C |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 30 |
#2 | ACCEPTED | 70 |
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.00 s | 2 | details |
#16 | ACCEPTED | 0.00 s | 2 | details |
#17 | ACCEPTED | 0.00 s | 2 | details |
#18 | ACCEPTED | 0.00 s | 2 | details |
#19 | ACCEPTED | 0.01 s | 2 | details |
#20 | ACCEPTED | 0.00 s | 2 | details |
#21 | ACCEPTED | 0.00 s | 2 | details |
#22 | ACCEPTED | 0.00 s | 2 | details |
#23 | ACCEPTED | 0.00 s | 2 | details |
#24 | ACCEPTED | 0.00 s | 2 | details |
Compiler report
input/code.c: In function 'main': input/code.c:101:62: warning: suggest parentheses around '&&' within '||' [-Wparentheses] 101 | if (distance_left <= 0 || distance_right < distance_left && distance_right >= 0) { | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ input/code.c:104:68: warning: suggest parentheses around '&&' within '||' [-Wparentheses] 104 | else if (distance_right <= 0 || distance_left < distance_right && distance_left >= 0) { | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~ input/code.c:81:5: warning: ignoring return value of 'fgets' declared with attribute 'warn_unused_result' [-Wunused-result] 81 | fgets(jou, 100, stdin); | ^~~~~~~~~~~~~~~~~~~~~~ input/code.c:85:5: warning: ignoring return value of 'fgets' declared with attribute 'warn_unused_result' [-Wunused-result] 85 | fgets(room_buffer, roomc+1, stdin); | ^~~~~~~~~~~~~~~~~~~~~~~...
Code
#include <stdio.h> #include <stdlib.h> #include <string.h> #include <stdint.h> long get_ri(const char* rooms, long max) { long pos = 0; for (long i = 0; i < max; i++) { if (rooms[i] == 'R') { pos = i; break; } } return pos; } void get_left_right(const char* rooms, long* leftP, long* rightP, long ri, long max) { *leftP = -1; *rightP = -1; for (long i = ri; i >= 0; i--) { if (rooms[i] == '*') { *leftP = i; break; } } for (long i = ri; i <= max; i++) { if (rooms[i] == '*') { *rightP = i; break; } } } void get_left(const char* rooms, long* leftP, long ri) { *leftP = -1; for (long i = ri; i >= 0; i--) { if (rooms[i] == '*') { *leftP = i; break; } } } void get_right(const char* rooms, long* rightP, long ri, long max) { *rightP = -1; for (long i = ri; i <= max; i++) { if (rooms[i] == '*') { *rightP = i; break; } } } void get_distance_lr(long leftP, long rightP, long* out_distanceL, long* out_distanceR, long ri) { if (leftP < 0) { *out_distanceL = -1; } else { *out_distanceL = ri - leftP; } if (rightP < 0) { *out_distanceR = -1; } else { *out_distanceR = rightP - ri; } } void move_to(char* rooms, long* ri, long to) { rooms[to] = '.'; *ri = to; } int main() { char jou[100]; fgets(jou, 100, stdin); long roomc = atol(jou); char room_buffer[200001]; fgets(room_buffer, roomc+1, stdin); long robot_index = get_ri(room_buffer, roomc); long coins_collected = 0; long distance = 0; long leftP; long rightP; long distance_left; long distance_right; get_left_right(room_buffer, &leftP, &rightP, robot_index, roomc); loop: if (leftP == -1 && rightP == -1) goto halt; get_distance_lr(leftP, rightP, &distance_left, &distance_right, robot_index); if (distance_left <= 0 || distance_right < distance_left && distance_right >= 0) { goto move_right; } else if (distance_right <= 0 || distance_left < distance_right && distance_left >= 0) { goto move_left; } else { goto halt; } move_left: move_to(room_buffer, &robot_index, leftP); get_left(room_buffer, &leftP, robot_index); coins_collected++; distance = distance + distance_left; goto loop; move_right: move_to(room_buffer, &robot_index, rightP); get_right(room_buffer, &rightP, robot_index, roomc); coins_collected++; distance = distance + distance_right; goto loop; halt: printf("%li %li\n", distance, coins_collected); 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 |