Submission #1986745

Source Code Expand

def solve():
    n = int(input())
    A = list(map(int ,input().split(" ")))
    students = []
    for i in range(1, n + 1):
        students.append((A[i - 1], i))

    students.sort()
    students.reverse()
    for ele in students:
        print(ele[1])
        

solve()

Submission Info

Submission Time
Task C - 背の順
User yumarimo
Language Python (3.4.3)
Score 100
Code Size 285 Byte
Status AC
Exec Time 220 ms
Memory 18812 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 3
AC × 19
AC × 31
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
Subtask1 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt, 2_04.txt, 2_05.txt, 2_06.txt, 2_07.txt, 2_08.txt, 2_09.txt, 2_10.txt, 2_11.txt
Case Name Status Exec Time Memory
0_00.txt AC 17 ms 2940 KB
0_01.txt AC 17 ms 3060 KB
0_02.txt AC 17 ms 2940 KB
1_00.txt AC 17 ms 2940 KB
1_01.txt AC 17 ms 2940 KB
1_02.txt AC 17 ms 2936 KB
1_03.txt AC 17 ms 2940 KB
1_04.txt AC 18 ms 3316 KB
1_05.txt AC 18 ms 3316 KB
1_06.txt AC 18 ms 3316 KB
1_07.txt AC 18 ms 3316 KB
1_08.txt AC 18 ms 3316 KB
1_09.txt AC 18 ms 3316 KB
1_10.txt AC 18 ms 3316 KB
1_11.txt AC 18 ms 3316 KB
1_12.txt AC 18 ms 3188 KB
1_13.txt AC 18 ms 3316 KB
1_14.txt AC 18 ms 3188 KB
1_15.txt AC 17 ms 3060 KB
2_00.txt AC 116 ms 18128 KB
2_01.txt AC 133 ms 18428 KB
2_02.txt AC 118 ms 18192 KB
2_03.txt AC 118 ms 18148 KB
2_04.txt AC 203 ms 18400 KB
2_05.txt AC 208 ms 18812 KB
2_06.txt AC 220 ms 18400 KB
2_07.txt AC 208 ms 18400 KB
2_08.txt AC 155 ms 14660 KB
2_09.txt AC 194 ms 17224 KB
2_10.txt AC 65 ms 7504 KB
2_11.txt AC 171 ms 15268 KB