Problem:


Score : 300 points

Problem Statement

Takahashi is a teacher responsible for a class of N students.

The students are given distinct student numbers from 1 to N.

Today, all the students entered the classroom at different times.

According to Takahashi's record, there were A_i students in the classroom when student number i entered the classroom (including student number i).

From these records, reconstruct the order in which the students entered the classroom.

Constraints

 1 \le N \le 10^5 

 1 \le A_i \le N 

 A_i \neq A_j  (i \neq j)

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 \ldots A_N

Output

Print the student numbers of the students in the order the students entered the classroom.

Sample Input 1

3
2 3 1

Sample Output 1

3 1 2

First, student number 3 entered the classroom.

Then, student number 1 entered the classroom.

Finally, student number 2 entered the classroom.

Sample Input 2

5
1 2 3 4 5

Sample Output 2

1 2 3 4 5

Sample Input 3

8
8 2 7 3 4 5 6 1

Sample Output 3

8 2 4 5 6 7 3 1



Sample input:
3
2 3 1


Sample output:
3 1 2

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
lis = [0] * N
k = 1
for i in A:
  lis[i-1] = k
  k += 1
lis = map(str, lis)
ans = " ".join(lis)
print(ans)

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
b=[0]*n
for i in range(n):
  x=a[i]
  b[x-1]=i+1

print(*b)

Submission status: Accepted

Solution code:
n = int(input())
a_l = list(map(int, input().split()))
ans = [0] * n 
for i, a in enumerate(a_l):
    ans[a-1] = i+1
print(*ans)

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))

l = sorted([(a[i], i+1) for i in range(n)])
c = [y for x, y in l]
print(' '.join(list(map(str, c))))

Submission status: Accepted

Solution code:
#-*-coding:utf-8-*-
import sys
input=sys.stdin.readline

def main():
    attended_people=[]
    sorted_attended_people=[]
    index_number=[]
    answer=[]
    n = int(input())
    attended_people=list(map(int,input().split()))
    index_number=[[idx,number] for idx,number in enumerate(attended_people)]
    sorted_attended_people=sorted(index_number,key=lambda x:x[1])
    for idx,data in sorted_attended_people:
        answer.append(str(idx+1))
    print(" ".join(answer))

if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
N = int(input())
L = list(map(int,input().split()))
d = {}
for i in range(N):
  d[L[i]] = i + 1
for j in range(1 , N + 1):
  print(d[j] , end = ' ')

Submission status: Accepted

Solution code:
# 回答を見て作成：一致検索はsort＋一致で時間がかかる？
n = int(input())
a = [int(x.strip()) for x in input().split()]
b = []
ans = str('')
for i in enumerate(a):
  b.append(i)
b.sort(key=lambda x:x[1])
for i in b:
  print(i[0]+1)

Submission status: Accepted

Solution code:
n = int(input())
line = list(map(int, input().split()))
ans = ['0' for i in range(n)]
for i in range(n):
  ans[line[i]-1] = str(i+1)
print(' '.join(ans))

Submission status: Accepted

Solution code:
n = int(input())
alist = list(map(int,input().split()))
numb = [0]*n
for i in range(n):
    numb[alist[i]-1] = i+1
for i in range(n):
    print(numb[i],end=(' '))

Submission status: Accepted

Solution code:
n=int(input())
s={i+1:int(x) for i,x in enumerate(input().split())}
s=sorted(s.items(), key=lambda x:x[1])
for i,j in s:
  print(i,end=' ')

Submission status: Accepted

Solution code:
N=int(input())
arr=list(map(int,input().split()))
brr=[]

for i in enumerate(arr):
    brr.append(i)
#print(brr)

brr.sort(key=lambda x:x[1])

for i in brr:
    print(i[0]+1)

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int,input().split()))
for i in range(N):
  A[i] = (A[i],i+1)
A.sort()
ans = ''
for tup in A:
  v, i = tup
  ans+=str(i)+' '
print(ans)

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
ans = []
for i in range(n):
    ans.append(0)
for i in range(n):
    ans[a[i]-1] = i +1
for i in range(len(ans)):
    print(ans[i], end=" ")

Submission status: Accepted

Solution code:
n=int(input())
a =list(map(int,input().split()))
l =[0]*n
for i in range(n):
        l[a[i]-1] = i+1
print(*l,sep=" ")

Submission status: Accepted

Solution code:
# C - Go to School 
N = int(input())
A = list(map(int,input().split()))
A = [(i+1,A[i]) for i in range(N)]
A.sort(key=lambda x:x[1])
A = [str(a[0]) for a in A]
print(' '.join(A))

Submission status: Accepted

Solution code:
N=int(input())
A=list(map(int,input().split()))
L=[0]*N
for i in range(N):
    L[A[i]-1]=i+1
L=[str(a) for a in L]
print(' '.join(L))

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
ans = [0] * N
for i, a in enumerate(A):
    ans[a-1] = i + 1
print(' '.join(map(str, ans)))

Submission status: Accepted

Solution code:
n=int(input())
s=list(map(int,input().split()))
p=[0]*n
for i in range(n):
  p[s[i]-1]=i+1
print(*p)

Submission status: Accepted

Solution code:
n=int(input())
s=list(map(int,input().split()))
p=["0"]*n
for i in range(n):
  p[s[i]-1]=str(i+1)
p=' '.join(p)
print(p)

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
idx = [0] * N
for i, val in enumerate(A):
  idx[val-1] = i + 1
for i in idx:
  print(i,end=" ")

Submission status: Accepted

Solution code:
N = int(input())
S = list(map(int,input().split()))
m = [0 for _ in range(N)]
for i in range(N):
  m[S[i]-1] = i+1
print(*m,sep=" ")

Submission status: Accepted

Solution code:
n=int(input())
a=[0]+[int(x) for x in input().split()]
ans=[0]*(n+1)

for i in range(len(a)):
    ans[a[i]]=i

ans.pop(0)

print(*ans)

Submission status: Accepted

Solution code:
N = int(input())
list = input().split()
answer = [0] * N

for i in range(N):
  answer[int(list[i]) - 1] = str(i + 1)

print(' '.join(answer))

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
l=[0]*(n)
for i in range(n):l[a[i]-1]=i+1
for i in l:
    print(i,end=" ")

Submission status: Accepted

Solution code:
N = int(input())
A = [int(x) for x in input().split()]

B = []
for i, a in enumerate(A):
    B.append([a, i + 1])

B.sort()

ans = []
for b in B:
    ans.append(b[1])

print(*ans)

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
ans = [0 for i in range(N)]
for i in range(N):
  ans[A[i]-1] = i+1
print(*ans)

Submission status: Accepted

Solution code:
import numpy
N = int(input())
A = [int(x) for x in input().split()]
a = numpy.argsort(A)
a += 1
print(*a)

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int,input().split()))
B = [[A[i],i+1]for i in range(N)]
B.sort()
ans = [B[i][1]for i in range(N)]
print(" ".join(map(str,ans)))

Submission status: Accepted

Solution code:
N = int(input())
a = list(map(int, input().split()))
ans = [0 for j in range(N)]

for i in range(N):
    ans[a[i]-1] = i + 1

print (*ans)

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
time = [0 for i in range(N)]

for i in range(N):
    time[A[i]-1] = i+1

for j in range(N):
    print(time[j],end=" ")

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
nu={}
for i in range(len(a)):
  nu[a[i]+1]=i+1
nu=sorted(nu.items())
b=[]
for i in nu:
  b.append(str(i[1]))
mojiretu = ' '.join(b)
print(mojiretu)

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))

student_arr = [(A[i], i) for i in range(N)]
student_arr.sort()

res = ''
for i in range(N):
    res += str(student_arr[i][1] + 1)
    if i < N - 1:
        res += ' '

print(res)

Submission status: Accepted

Solution code:
import numpy as np

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

A_sorted = np.argsort(A)

print(*A_sorted+1)

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))

l = [0]*N
for i,a in enumerate(A):
  l[a-1]=i+1
  
for x in l:
  print(x, end=' ')

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    a_list = list(map(int, input().split()))
    ans_list = [0] * n

    for i in range(n):
        ans_list[a_list[i] - 1] = i + 1

    for ans in ans_list:
        print(ans, end=" ")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    a_list = list(map(int, input().split()))
    lst = [[i, x] for i, x in enumerate(a_list)]
    lst.sort(key = lambda x: x[1])

    for i in lst:
        print(i[0] + 1, end=" ")

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = int(input())
A = list(map(int,input().split()))
ans = [0]*n
for i in range(n):
    ans[A[i] - 1] = str(i + 1)

Ans = ' '.join(ans)
print(Ans)

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
b=[0]*n
for i in range(n):
    b[a[i]-1]=i+1
print(*b)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    N=I()
    A=LI()
    L=[]
    for i in range(N):
        L.append([A[i],i])
        
    L.sort()
    ans=[]
    for i in range(N):
        ans.append(L[i][1]+1)
        
    print(' '.join(map(str, ans)))

main()

Submission status: Accepted

Solution code:
N = int(input())
students = list(map(int, input().split()))

sorted_students = [str(x[0] + 1) for x in sorted([x for x in enumerate(students)], key=lambda x: x[1])]

print(' '.join(sorted_students))

Submission status: Accepted

Solution code:
n = int(input())
h = list(map(int,input().split()))
q = [0]*n
for i in range(n):
    q[h[i]-1] = i+1
print(*q)

Submission status: Accepted

Solution code:
a=int(input())
b=list(map(int,input().split()))
c=[0]*a
"""
for i in range(a):
    c.append(b.index(i+1)+1) #おそらく計算量O(N^2)
"""
for i in range(a):
    c[b[i]-1]=i+1
result = ' '.join(map(str,c))
print(result)

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = list(range(1,a[0]+1))
dict = dict(zip(b,c))
for i in range(len(b)):
  print(dict.get(i+1),end=" ")

Submission status: Accepted

Solution code:
import numpy as np
N = int(input())
A = list(map(int, input().split()))
ans = np.zeros(N)
for i in range(N):
  ans[A[i]-1] = i + 1
  
ans = list(map(int, ans))
ans = list(map(str, ans))
print(" ".join(ans))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
b = sorted(enumerate(a), key=lambda x:x[1])
c = [b[i][0]+1 for i in range(n)]
d = [str(x) for x in c]
e = " ".join(d)
print(e)

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int,input().split()))
a = [0]*N
for i in range(N):
    a[A[i]-1] = i + 1
print(*a)

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
d=[0]*n
for i in range(n):
  d[a[i]-1]=i+1
print(*d)

Submission status: Accepted

Solution code:
num = int(input())
str_line = input().split(" ")
num_line = [int(n) for n in str_line]

rank_line = [0 for i in range(num)]

for i in range(num):
    rank_line[num_line[i] - 1] = i+1

for i in range(num):
    print(rank_line[i],end="")
    if(i != num-1):
        print(" ",end="")

Submission status: Accepted

Solution code:
N = int(input())
N_List =list(map(int,input().split()))
ans = [0] * N
for i in range(N):
    s = N_List[i]   
    ans[s-1] = i+1  
print(*ans)

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    a = [int(_) for _ in input().split()]

    order = [0 for i in range(n)]

    for i in range(n):
        order[a[i] - 1] = i + 1


#        order.append(a.index(i+1) + 1)

    print(*order)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
x = [0] * n

for i, v in enumerate(a):
    x[v - 1] = i + 1

print(*x)

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
D = {}
for i in range(N):
	i+=1
	D.update([(A[i-1], i)])

ans = []
for i in range(1, N+1):
	ans.append(D[i])

str_ans = list(map(str, ans))
print(' '.join(str_ans))

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
s=[0]*n
for i in range(n):
	s[a[i]-1]=i+1
	
	
print(*s)

Submission status: Accepted

Solution code:
# 問題：https://atcoder.jp/contests/abc142/tasks/abc142_c

n = int(input())
a = list(map(int, input().strip().split()))
appear_attendance_number = {}
for i in range(n):
    appear_attendance_number[a[i]-1] = i+1
res = []
for i in range(n):
    res.append(appear_attendance_number[i])
print(' '.join(map(str, res)))

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int,input().split()))

Adict = {}

for i in range(N):
    Adict[A[i]] = (i+1)

ans = []
for i in range(1,N+1):
    ans.append(str(Adict[i]))

print(" ".join(ans))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
lists = [0] * n
 
for i in range(n):
    lists[a[i] - 1] = i + 1
    
for i in lists:
  print(i , end =' ')

Submission status: Accepted

Solution code:
n=int(input())
a=[x for x in input().split()]
ans=[0]*n
for i in range(n):
    ans[int(a[i])-1] = i+1
    
print(*ans)

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int,input().split()))
b = []
for i in range(n):
  b.append(0)
for i in range(n):
  b[a[i]-1] = i+1
for i in range(n):
  print(b[i],end=" ")

Submission status: Accepted

Solution code:
n = int(input())
toko = [int(i) for i in input().split()]

ans = [int(0) for i in range(n)]

for j in range(n): ##01234
  ans[toko[j]-1] = j + 1
  
print(' '.join(map(str, ans)))

Submission status: Accepted

Solution code:
import sys
from collections import deque
import numpy as np
import math
sys.setrecursionlimit(10**6)
def S(): return sys.stdin.readline().rstrip()
def SL(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return map(int,sys.stdin.readline().rstrip().split())

def solve():
    la = [(item,i+1) for i,item in enumerate(a)]
    la.sort()
    for rep in la:
        print(f"{rep[1]} ",end="")
    return

if __name__=='__main__':
    n = I()
    a = list(IL())
    solve()

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
a = [(i, j) for i, j in enumerate(a, start=1)]
a.sort(key=lambda x: x[1])
a = [str(i) for i, j in a]
print(' '.join(a))

Submission status: Accepted

Solution code:
n = int(input())

a = list(map(int, input().split()))
b = list(enumerate(a))
c = sorted(b, key=lambda x:x[1])


print(*[c[i][0]+1 for i in range(n)])

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
s=[0]*n
for i in range(n):
    s[a[i]-1]=i+1
print(*s)

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
lists = [0] * n

for i in range(n):
    lists[a[i] - 1] = i + 1
    
for i in lists:
  print(i , end =' ')

Submission status: Accepted

Solution code:
N=int(input())
A=list(map(int,input().split()))
for i in range(N):
    A[i] = [i+1, A[i]]

A.sort(key=lambda x:x[1])

ans=[]
for i in range(N):
    ans.append(A[i][0])

ans = map(str, ans)
print(' '.join(ans))

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
B = [0 for i in range(N)]
for i in range(N):
  B[A[i]-1] = i
for b in B:
  print(b+1)

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
b = [0]*n
for i in range(n):
    b[a[i]-1] = i+1
print(*b)

Submission status: Accepted

Solution code:
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))  #空白あり

N = I()
A = LI()
for i in range(N):
    A[i] = (A[i],i)
A.sort()

print(*[A[i][1]+1 for i in range(N)])

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline
N = int(input())
A = list(map(int, input().split()))

B = []
for i in range(N):
    B.append((A[i], i+1))

ans = []
for (a, n) in sorted(B):
    ans.append(n)

print(*ans)

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))

ans = [0]*N
for idx, a in enumerate(A):
    ans[a-1] = idx+1
print(*ans)

Submission status: Accepted

Solution code:
N, *A = map(int, open(0).read().split())

ans = [0] * N
for i in range(N):
    ans[A[i]-1] = i+1 

print(*ans)

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
ls = [(A[i], i) for i in range(N)]
ls.sort()
ans = [ls[i][1]+1 for i in range(N)]
print(*ans)

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))

b=[]
for i in range(n):
    tmp=[i+1,a[i]]
    b.append(tmp)

b=sorted(b,key=lambda x:x[1])


ans=[]
for j in b:
    ans.append(j[0])

print(*ans)

Submission status: Accepted

Solution code:
N = int(input())
A = {int(x): key for key, x in enumerate(input().split(), 1)}
sort_a = sorted(A.items(), key=lambda x: x[0])

print(' '.join([str(key) for x, key in sort_a]))

Submission status: Accepted

Solution code:
N = int(input())

ans = [0]*N
count = 1
for i in input().split():
    i = int(i)
    ans[i-1] = count
    count += 1

for i in ans:
    print(i, end=" ")

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

N = int(input())
As = list(mapint())

lis = [-1]*N
for i in range(N):
    a = As[i]
    lis[a-1] = str(i+1)
print(' '.join(lis))

Submission status: Accepted

Solution code:
N=int(input())
A=list(map(int, input().split()))
ans=[0]*N

for i in range(N):
    a=A[i]
    ans[a-1]=i+1

print(*ans)

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
d=[]
for i in range(1,n+1):
  d.append([a[i-1],i])
d.sort()
ans=[]
for i in range(n):
  ans.append(d[i][1])
  
print(*ans)

Submission status: Accepted

Solution code:
def main():
   n = int(input())
   a = list(map(int,input().split()))
   b = [(0,0) for i in range(n)]
   for i in range(n):
       b[i] = (a[i],i + 1)
   b.sort()
   for i in range(n):
       if i != n - 1:
           print(b[i][1],end = " ")
       else:
           print(b[i][1])

main()

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))

ans = [0] * N
for i in range(N):
    ans[A[i]-1] = i + 1

print(" ".join([str(x) for x in ans]))

Submission status: Accepted

Solution code:
N = int(input())

A = list(map(int,input().split()))

memo = [0]*N

for i in range(len(A)):
    memo[A[i]-1] = i+1
print(*memo)

Submission status: Accepted

Solution code:
n = map(int, input().split())
a = list(map(int, input().split()))

arr = [(x, i + 1) for i, x in enumerate(a)]
arr.sort()

ans = [x[1] for x in arr]

print(*ans)

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int,input().split()))
B = [(A[i],i+1) for i in range(N)]
B.sort()
ans = []
for i in range(N):
  ans.append(B[i][1])
print(*ans)

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right 
import sys,math,itertools,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

n = inp()
a = inpl()
res = [0] * n
for i,x in enumerate(a):
    res[x-1] = i+1
print(*res)

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
ans = [None] * N
for i in range(N):
    ans[A[i]-1] = i+1
print(*ans)

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))  #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))  #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())  #空白あり
def LS2(): return list(sys.stdin.readline().rstrip())  #空白なし

N = I()
A = LI()
for i in range(N):
    A[i] = (A[i],i)
A.sort()

print(*[A[i][1]+1 for i in range(N)])

Submission status: Accepted

Solution code:
n = int(input())
al = list(map(int, input().split()))
ail = []
for i,a in enumerate(al):
    ail.append((a,i+1))

ail.sort()
ans = []
for i,a in ail:
    ans.append(a)

print(*ans)

Submission status: Accepted

Solution code:
N=int(input())
A=map(int, input().split())
A=list(A)

ans= [0] * len(A)
for i,a in enumerate(A):
    ans[a-1]= i+1
print(' '.join(map(str,ans)))

Submission status: Accepted

Solution code:
N=int(input())
A=list(map(int,input().split()))
B=[0]*N
for i in range(N):
    B[A[i]-1]=i+1
print(*B)

Submission status: Accepted

Solution code:
def some():
    n = int(input())
    h = map(int, input().split(" "))
    h = sorted((i, index) for index, i in enumerate(h, 1))
    print(" ".join(str(num) for _, num in h))
some()

Submission status: Accepted

Solution code:
import sys
import numpy as np
import numba
from numba import jit

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

@jit
def main(n, a):
  ans = np.zeros(n)
  for i, j in enumerate(a):
    ans[j-1] = i+1
  for i in ans:
    print(int(i), end=' ')
n = int(readline())
a = np.array(readline().split(), np.int64)
main(n,a)

Submission status: Accepted

Solution code:
n = int(input())
num_list = list(map(int, input().split()))

ans_list = [0]*n
for i, j in enumerate(num_list):
    ans_list[j-1] = str(i+1)

ans = ' '.join(ans_list)
print(ans)

Submission status: Accepted

Solution code:
N=int(input())
A = list(map(int, input().split()))
C=[0]*N
for i in range(0,N):
    C[A[i]-1]=i+1
print(*C)

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int,input().split()))
b = [0]*n
for i,j in enumerate(a):
    b[j-1] = str(i+1)
print(" ".join(b))

Submission status: Accepted

Solution code:
n=int(input())
a=[int(x) for x in input().split()]
b=[0]*n
for i in range(n):
  b[a[i]-1]=i+1
print(' '.join(map(str, b)))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))

aa = [[a[i], i] for i in range(n)]
aa.sort()

print(' '.join(str(aa[i][1] + 1) for i in range(n)))

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))

num=[i for i in range(1,n+1)]

order=dict(zip(num,a))

order2=sorted(order.items(),key=lambda x:x[1])

ans=[]

for i in range(n):
  ans.append(order2[i][0])

print(' '.join([str(n) for n in ans]))

Submission status: Accepted

Solution code:
n=int(input())
l=list(map(int,input().split()))

n_lis=[i for i in range(1,n+1)]
dic={i:j for i,j in zip(l,n_lis)}
num_lis=[str(dic[i]) for i in range(1,n+1)]
print(' '.join(num_lis))

Submission status: Accepted

Solution code:
n = int(input())

a = [int(e) for e in input().split()]

ans = [0] * n   
 
for i in range(n):
    s = a[i]   
    ans[s-1] = i+1    
 
print(*ans)

Submission status: Accepted

Solution code:
n=int(input())
l=list(map(int,input().split()))
ans=[0]*n
for i in range(len(l)):
    ans[l[i]-1]=i+1
print(*ans)

Submission status: Accepted

Solution code:
n = int(input())
l = sorted(list(enumerate(map(int,input().split()),start = 1)), key = lambda x:x[1])
print(*(l[i][0] for i in range(n)))

Submission status: Accepted

Solution code:
N = int(input())
a = list(map(int, input().split()))
rev = [0]*N
for i in range(N):
    rev[a[i] - 1] = i +1
for i in range(N):
    print(rev[i], end=" ")

Submission status: Accepted

Solution code:
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy
# ! /usr/bin/env python
# -*- coding: utf-8 -*-
import heapq
sys.setrecursionlimit(10**6)
# INF =  float("inf")
INF = 10**18
import bisect
import statistics
mod = 10**9+7
# mod = 998244353
import numpy

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

a = numpy.argsort(A)
b = []
for i in range(N):
    b.append(str(a[i]+1))

print(" ".join(b))

Submission status: Accepted

Solution code:
N = int(input())
A = [int(a) for a in input().split()]

attend = [0] * N
for i in range(N):
    attend[A[i]-1] = str(i+1)

res = ' '.join(attend)

print(res)

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int,input().split()))
#(順位,出席番号)
a = [(a[i], i+1) for i in range(n)]
a.sort(key=lambda x: x[0])
b = list(zip(*a))
ans = b[1]

print(*ans)

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
result = [0] * N
for i in range(N):
	result[A[i]-1] = str(i+1)
s = ' '.join(result)
print(s)

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
num=["0"]*n
count="1"

for i in a:
  num[i-1]=count
  count=int(count)
  count+=1
  count=str(count)
  
print(" ".join(num))

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from collections import Counter,defaultdict,deque
# from itertools import permutations, combinations
# from heapq import heappop, heappush
# # input = sys.stdin.readline
# sys.setrecursionlimit(10**8)
# mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

n = inp()
l = inpl()
dic = {}
for i in range(0, len(l)):
    dic.setdefault(i, l[i])
sl = sorted(dic.items(), key=lambda x:x[1])
ans=[str(x[0] + 1) for x in sl]
print(' '.join(ans))

Submission status: Accepted

Solution code:
n=int(input())
a=[int(i)for i in input().split()]
res=[0 for i in range(n)]
for i in range(n):
    res[a[i]-1]=i+1
print(" ".join(map(str,res)))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
a_to_index = [0] * n
for i in range(n):
    a_to_index[a[i]-1] = i + 1
a.sort()
ans = [0] * n
for index, ai in enumerate(a):
    ans[index] = a_to_index[ai-1]
print(*ans)

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
a  = []
for i in range(N):
    a.append([A[i], i])
a.sort()
b = []
for i in a:
    b.append(i[-1]+1)
print(*b)

Submission status: Accepted

Solution code:
import numpy as np

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

ans = [0] * N

for i in range(N):
    ans[A[i]-1] = i+1

print(*ans, sep=' ')

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
order = [0] * n
for i in range(n):
    order[a[i]-1] = i+1
for i in range(n):
    print(order[i], end=" ")

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int,input().split()))
ans = {}
for i in range(n):
    ans[a[i]] = i + 1
s = [ans[i+1] for i in range(n)]
print(*s)

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
import numpy as np
A = np.array(A)
ans = np.argsort(A)
ans = list(str(a + 1) for a in ans)
ans = ' '.join(ans)
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys 
input = sys.stdin.readline

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

d = {}
for i in range(n):
    d[i] = a[i]

d = sorted(d.items(), key=lambda x:x[1])
ans = ''
for i in range(n):
    ans += str((d[i][0]+1)) + ' ' 

print(ans)

Submission status: Accepted

Solution code:
n = int(input()) 
a_list = list(map(int, input().split()))
res = sorted(range(n), key=lambda k: a_list[k])
print(' '.join(list(map(lambda x: str(x+1), res))))

Submission status: Accepted

Solution code:
n = int(input())
A = list(map(int, input().split()))

dic = {}
for i in range(n):
  dic[A[i]] = i+1

ans = [dic[i+1] for i in range(n)]
print(*ans)

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))

ans = [0] * N
for i in range(N):
    ans[A[i]-1] = i + 1
print(*ans)

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
sorted_a = []
for i in range(n):
    sorted_a.append([a[i], i])

sorted_a.sort()
# print(sorted_a)
ans = []
for i in range(n):
    ans.append(sorted_a[i][1]+1)
print(*ans)

Submission status: Accepted

Solution code:
n = int(input())
a_list = list(map(int, input().split()))
ans_list =[0]*n
for i in range(n):
    ans_list[a_list[i]-1] = i+1
print(*ans_list)

Submission status: Accepted

Solution code:
n=int(input())
*a,=map(int,input().split())

b=sorted([(a[i],str(i+1)) for i in range(n)],key=lambda x:x[0])

print(' '.join([c for _,c in b]))

Submission status: Accepted

Solution code:
N=int(input())
List = list(map(int, input().split()))
resList = [0]*N
for i in range(N):
  resList[List[i]-1] = i+1
print(*resList)

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(lambda a: int(a), input().split(" ")))
B = [{"id": i + 1, "order": A[i]} for i in range(len(A))]

B.sort(key=lambda b: b["order"])

print(" ".join([str(b["id"]) for b in B]))

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
B = [[] for i in range(N)]
for i in range(N):
  B[i] = [A[i], i+1]
B.sort()
ans = [0 for i in range(N)]
for i in range(N):
  ans[i] = B[i][1]
print(*ans)

Submission status: Accepted

Solution code:
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


n = int(input())
a = list(map(int, input().split()))
aa = [(num,i) for i,num in enumerate(a)]
aa.sort()
write(" ".join(map(str, [item[1]+1 for item in aa])))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
order = []
for i in range(n):
    order.append((i + 1, a[i]))
order.sort(key=lambda x: x[1])
print(" ".join(list(map(lambda x: str(x[0]), order))))

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))

ans = [0]*N
for n in range(N):
    ans[A[n]-1] = str(n+1)
    

print(" ".join(ans))

Submission status: Accepted

Solution code:
n = int(input())
l = list(map(int, input().split()))
c = {}
for i in range(n):
  c[l[i]] = i + 1
c = sorted(c.items())
[print(s[1], end=" ") for s in c]

Submission status: Accepted

Solution code:
def gotoS(org, n):
	res = [0] * n
	for i in range(1, n+1):
		res[org[i-1]-1] = i
	return res
n = int(input())
org = list(map(int, input().split()))
print(*gotoS(org, n))

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int,input().split()))
students = [0]*N
for i in range(N):
    students[A[i]-1] = i+1
print(' '.join(map(str,students)))

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
a = [0] * N
for i in range(N):
	a[A[i] - 1] = i + 1
print(*a)