Task: | Robotti |
Sender: | eeronaali |
Submission time: | 2024-11-01 00:42:58 +0200 |
Language: | Python3 (PyPy3) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.04 s | 1, 2 | details |
#2 | ACCEPTED | 0.04 s | 1, 2 | details |
#3 | WRONG ANSWER | 0.04 s | 1, 2 | details |
#4 | WRONG ANSWER | 0.04 s | 1, 2 | details |
#5 | WRONG ANSWER | 0.05 s | 1, 2 | details |
#6 | WRONG ANSWER | 0.04 s | 1, 2 | details |
#7 | WRONG ANSWER | 0.06 s | 1, 2 | details |
#8 | WRONG ANSWER | 0.08 s | 1, 2 | details |
#9 | WRONG ANSWER | 0.08 s | 1, 2 | details |
#10 | WRONG ANSWER | 0.07 s | 1, 2 | details |
#11 | WRONG ANSWER | 0.07 s | 1, 2 | details |
#12 | WRONG ANSWER | 0.14 s | 2 | details |
#13 | WRONG ANSWER | 0.13 s | 2 | details |
#14 | WRONG ANSWER | 0.87 s | 2 | details |
#15 | WRONG ANSWER | 0.59 s | 2 | details |
#16 | WRONG ANSWER | 0.59 s | 2 | details |
#17 | ACCEPTED | 0.07 s | 2 | details |
#18 | TIME LIMIT EXCEEDED | -- | 2 | details |
#19 | WRONG ANSWER | 0.08 s | 2 | details |
#20 | ACCEPTED | 0.06 s | 2 | details |
#21 | WRONG ANSWER | 0.08 s | 2 | details |
#22 | TIME LIMIT EXCEEDED | -- | 2 | details |
#23 | TIME LIMIT EXCEEDED | -- | 2 | details |
#24 | TIME LIMIT EXCEEDED | -- | 2 | details |
Code
# Syöte rooms = int(input()) building = [x for x in input()] #rooms = 20 #building = list(x for x in "**.*......*.R*...*..") # Kolikkojen lukumäärä all_coins = building.count("*") # Laskurit steps = 0 coins_collected = 0 # Robotin aloitussijainti robot_position = building.index("R") # OHJELMA while True: #1. etsitään lähin kolikko positions = [rooms, rooms] for i in range(robot_position, 0, -1): if building[i] == "*": positions[0] = i for j in range(robot_position, rooms): if building[j] == "*": positions[1] = j shortest_path = min(abs(robot_position - positions[0]), abs(robot_position - positions[1])) - robot_position #2. jos kolikot yhtä lähellä tai kaikki kolikot on kerätty --> break if (abs(robot_position - positions[0]) == abs(robot_position - positions[1])) or (coins_collected == all_coins): break #3. liikutaan ja kerätään kolikko robot_position += shortest_path building[robot_position] = "." steps += abs(shortest_path) coins_collected += 1 # Tulostus print (steps, coins_collected)
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: WRONG ANSWER
input |
---|
10 **.R...*** |
correct output |
---|
12 5 |
user output |
---|
9 3 |
Test 4
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
10 ***R****** |
correct output |
---|
0 0 |
user output |
---|
51 9 |
Test 5
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 R................................ |
correct output |
---|
947 9 |
user output |
---|
6447 9 |
Test 6
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 ................................. |
correct output |
---|
886 9 |
user output |
---|
7702 9 |
Test 7
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 .....*..*....**..**..*......*.... |
correct output |
---|
1287 400 |
user output |
---|
336922 400 |
Test 8
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 ************.*****************... |
correct output |
---|
0 0 |
user output |
---|
585552 900 |
Test 9
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 ******************************... |
correct output |
---|
0 0 |
user output |
---|
684255 999 |
Test 10
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 R*****************************... |
correct output |
---|
999 999 |
user output |
---|
995009 999 |
Test 11
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 ******************************... |
correct output |
---|
999 999 |
user output |
---|
995006 999 |
Test 12
Group: 2
Verdict: WRONG ANSWER
input |
---|
10000 .......**........*...........*... |
correct output |
---|
10971 999 |
user output |
---|
8545284 999 |
Test 13
Group: 2
Verdict: WRONG ANSWER
input |
---|
10000 *..*....*......*.....*..*........ |
correct output |
---|
9999 999 |
user output |
---|
9982014 999 |
Test 14
Group: 2
Verdict: WRONG ANSWER
input |
---|
10000 *.*.*...**.*...*....**.**.**..... |
correct output |
---|
18766 5000 |
user output |
---|
43814928 5000 |
Test 15
Group: 2
Verdict: WRONG ANSWER
input |
---|
10000 R*****************************... |
correct output |
---|
9999 9999 |
user output |
---|
99950009 9999 |
Test 16
Group: 2
Verdict: WRONG ANSWER
input |
---|
10000 ******************************... |
correct output |
---|
9999 9999 |
user output |
---|
99950006 9999 |
Test 17
Group: 2
Verdict: ACCEPTED
input |
---|
200000 ................................. |
correct output |
---|
0 0 |
user output |
---|
0 0 |
Test 18
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 ................................. |
correct output |
---|
299934 10000 |
user output |
---|
(empty) |
Test 19
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 **.***....**..**.....***.*..*.... |
correct output |
---|
299998 100000 |
user output |
---|
0 0 |
Test 20
Group: 2
Verdict: ACCEPTED
input |
---|
200000 ******************************... |
correct output |
---|
0 0 |
user output |
---|
0 0 |
Test 21
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 R................................ |
correct output |
---|
133765 3 |
user output |
---|
246589 3 |
Test 22
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 R................................ |
correct output |
---|
199982 5000 |
user output |
---|
(empty) |
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) |