Submission #64301945

Source Code Expand

N = int(input())
P = list(map(int, input().split()))
Q = P.copy()
Q.sort(reverse = True)
S = []
for i in range(N):
  S.append([Q[i],i+1])
B = []
m = -1
for i in range(N):
  if S[i][0] != m:
    B.append(S[i])
    m = S[i][0]

for i in range(N):
  for j in range(len(B)):
    if P[i] == B[j][0]:
      print(B[j][1])

Submission Info

Submission Time
Task B - Ranking with Ties
User G212
Language Python (CPython 3.11.4)
Score 200
Code Size 336 Byte
Status AC
Exec Time 10 ms
Memory 8612 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 4
AC × 21
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 01_random_00.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 02_random2_00.txt, 02_random2_01.txt, 02_random2_02.txt, 02_random2_03.txt, 02_random2_04.txt, 02_random2_05.txt, 02_random2_06.txt, 02_random2_07.txt, 02_random2_08.txt, 03_sorted_00.txt, 03_sorted_01.txt, 04_handmade_00.txt, 04_handmade_01.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 9 ms 8508 KiB
00_sample_01.txt AC 9 ms 8500 KiB
00_sample_02.txt AC 9 ms 8532 KiB
00_sample_03.txt AC 9 ms 8424 KiB
01_random_00.txt AC 9 ms 8484 KiB
01_random_01.txt AC 9 ms 8532 KiB
01_random_02.txt AC 9 ms 8612 KiB
01_random_03.txt AC 9 ms 8568 KiB
02_random2_00.txt AC 9 ms 8404 KiB
02_random2_01.txt AC 9 ms 8468 KiB
02_random2_02.txt AC 9 ms 8500 KiB
02_random2_03.txt AC 9 ms 8524 KiB
02_random2_04.txt AC 9 ms 8512 KiB
02_random2_05.txt AC 9 ms 8596 KiB
02_random2_06.txt AC 9 ms 8436 KiB
02_random2_07.txt AC 10 ms 8564 KiB
02_random2_08.txt AC 10 ms 8496 KiB
03_sorted_00.txt AC 9 ms 8532 KiB
03_sorted_01.txt AC 10 ms 8552 KiB
04_handmade_00.txt AC 9 ms 8476 KiB
04_handmade_01.txt AC 9 ms 8512 KiB