Submission #2207417

Source Code Expand

N = int(input())
a = list(map(int,input().split()))

height = {}
for i in range(N):
	if a[i] not in height:
		height[a[i]] = i + 1
a = sorted(a, reverse=True)

for ai in a:
	print(height[ai])

Submission Info

Submission Time
Task C - 背の順
User ty70
Language Python (3.4.3)
Score 100
Code Size 201 Byte
Status AC
Exec Time 199 ms
Memory 20620 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 3060 KB
0_01.txt AC 17 ms 3060 KB
0_02.txt AC 17 ms 2940 KB
1_00.txt AC 17 ms 3060 KB
1_01.txt AC 17 ms 2940 KB
1_02.txt AC 17 ms 2940 KB
1_03.txt AC 17 ms 3060 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 19 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 3316 KB
1_13.txt AC 18 ms 3316 KB
1_14.txt AC 18 ms 3316 KB
1_15.txt AC 17 ms 3060 KB
2_00.txt AC 134 ms 20576 KB
2_01.txt AC 134 ms 19700 KB
2_02.txt AC 143 ms 20448 KB
2_03.txt AC 134 ms 20448 KB
2_04.txt AC 185 ms 20620 KB
2_05.txt AC 182 ms 20520 KB
2_06.txt AC 199 ms 20620 KB
2_07.txt AC 187 ms 20620 KB
2_08.txt AC 145 ms 13844 KB
2_09.txt AC 169 ms 20208 KB
2_10.txt AC 62 ms 7460 KB
2_11.txt AC 161 ms 14024 KB