Submission #11594477

Source Code Expand

#!/usr/bin/python3
n = int(input())
list_input = []
list_red = []
list_blue = []
for i in range(n):
    list_input.append(list(map(str,input().split())))
for i in range(n):
    if list_input[i][1] == "R":
        list_red.append(int(list_input[i][0]))
    elif list_input[i][1] == "B":
        list_blue.append(int(list_input[i][0]))
list_red.sort()
list_blue.sort()
if len(list_red) != 0:
    for i in range(len(list_red)):
        print(list_red[i])
if len(list_blue) != 0:
    for i in range(len(list_blue)):
        print(list_blue[i])

Submission Info

Submission Time
Task B - Picking Balls
User nesosuke
Language Python (3.8.2)
Score 200
Code Size 558 Byte
Status AC
Exec Time 22 ms
Memory 9224 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 21
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt AC 16 ms 8924 KiB
02.txt AC 20 ms 9160 KiB
03.txt AC 22 ms 9088 KiB
04.txt AC 18 ms 8932 KiB
05.txt AC 22 ms 9224 KiB
06.txt AC 19 ms 9084 KiB
07.txt AC 16 ms 9160 KiB
08.txt AC 19 ms 9024 KiB
09.txt AC 18 ms 9220 KiB
10.txt AC 20 ms 9028 KiB
11.txt AC 16 ms 9036 KiB
12.txt AC 19 ms 8928 KiB
13.txt AC 17 ms 8932 KiB
14.txt AC 19 ms 9036 KiB
15.txt AC 17 ms 8932 KiB
16.txt AC 17 ms 9160 KiB
17.txt AC 17 ms 9036 KiB
18.txt AC 18 ms 8880 KiB
19.txt AC 17 ms 8924 KiB
s1.txt AC 17 ms 9028 KiB
s2.txt AC 17 ms 8920 KiB