CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:DiscoFlower8890
Submission time:2024-10-31 09:52:32 +0200
Language:Python3 (PyPy3)
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED30
#2ACCEPTED70
Test results
testverdicttimegroup
#1ACCEPTED0.04 s1, 2details
#2ACCEPTED0.04 s1, 2details
#3ACCEPTED0.04 s1, 2details
#4ACCEPTED0.04 s1, 2details
#5ACCEPTED0.04 s1, 2details
#6ACCEPTED0.04 s1, 2details
#7ACCEPTED0.04 s1, 2details
#8ACCEPTED0.04 s1, 2details
#9ACCEPTED0.04 s1, 2details
#10ACCEPTED0.04 s1, 2details
#11ACCEPTED0.04 s1, 2details
#12ACCEPTED0.05 s2details
#13ACCEPTED0.05 s2details
#14ACCEPTED0.06 s2details
#15ACCEPTED0.05 s2details
#16ACCEPTED0.04 s2details
#17ACCEPTED0.06 s2details
#18ACCEPTED0.07 s2details
#19ACCEPTED0.38 s2details
#20ACCEPTED0.08 s2details
#21ACCEPTED0.06 s2details
#22ACCEPTED0.06 s2details
#23ACCEPTED0.07 s2details
#24ACCEPTED0.07 s2details

Code

n = int(input())
data = list(input())

def move_to_closest():
    global robot_index
    if(indices[robot_index]-indices[robot_index-1] < indices[robot_index+1]-indices[robot_index]):
        distance = indices[robot_index]-indices[robot_index-1]
        indices.pop(robot_index)
        robot_index -= 1
        return distance
    elif(indices[robot_index]-indices[robot_index-1] > indices[robot_index+1]-indices[robot_index]):
        distance = indices[robot_index+1]-indices[robot_index]
        indices.pop(robot_index)
        return distance
    else:
        raise ValueError('Closest room is ambiguous')

def only_left():
    global robot_index
    return indices[robot_index]-indices[0]

def only_right():
    global robot_index
    return indices[-1]-indices[robot_index]

def main(input_rooms):
    global rooms_list, indices, robot_index

    rooms_list = input_rooms
    rooms_iter = iter(rooms_list)

    indices = []
    robot_index = 0
    steps_taken = 0
    coins_collected = 0

    for index, value in enumerate(rooms_iter):
        if(value == '*'):
            indices.append(index)
        elif(robot_index == 0 and value == 'R'):
            robot_index = len(indices)
            indices.append(index)

    while(len(indices) > 1):
        try:
            if(robot_index == 0):
                coins_collected += len(indices)-1
                steps_taken += only_right()
                indices.clear()
            elif(robot_index == len(indices)-1):
                coins_collected += len(indices)-1
                steps_taken += only_left()
                indices.clear()
            else:
                steps_taken += move_to_closest()
                coins_collected += 1
        except ValueError:
            break
        except Exception as e:
            raise e
        
    print(steps_taken, coins_collected)

if __name__ == "__main__":
    main(data)

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