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:
"""
author : halo2halo
date : 18,Oct,2019
"""

import sys
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)


N = int(readline())
A = [int(x) for x in readline().split()]
ans = [None]*N

for i, a in enumerate(A):
    ans[a-1] = i+1


print(*ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
A = map(int, input().split())
order_list = []
for i,a in enumerate(A,1):
  order_list.append((i,a))
order_list.sort(key=lambda x:x[1])
print(' '.join(str(ans[0]) for ans in order_list))

Submission status: Accepted

Solution code:
n = int(input())
students = list(map(lambda x: int(x)-1,input().split()))
arrived = [0]*n

for i in range(n):
    arrived[students[i]] = i

for i in range(n):
    print(arrived[i]+1,end=" ")
print()

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
dic = {i: A[i] for i in range(N)}
dic = sorted(dic.items(), key=lambda x: x[1])
dic = list(zip(*dic))
ans = [print(dic[0][i] + 1) for i in range(N)]

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
dic = {}
for i in range(N):
    dic[i] = A[i]
dic = sorted(dic.items(), key=lambda x: x[1])
dic = list(zip(*dic))
ans = [dic[0][i] + 1 for i in range(N)]
for i in ans:
    print(i)

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
dic = {}
for i in range(N):
    dic[i] = A[i]
dic = sorted(dic.items(), key=lambda x: x[1])
# print(dic)
# print(list(zip(*dic)))
dic = list(zip(*dic))
# dic = list(map(lambda x: x+1, dic))
ans = [dic[0][i] + 1 for i in range(N)]
ans = str(ans).replace(',', '')
ans = ans.replace('[', '')
ans = ans.replace(']', '')
print(ans)

Submission status: Accepted

Solution code:
import numpy as np
n=int(input())
a=list(map(int,input().split()))
  
x = np.argsort(a)
for i in range(n):
  print(x[i]+1)

Submission status: Accepted

Solution code:
N=int(input())
A=map(int,input().split())
L=[]
for i,a in enumerate(A,1):
    L.append((i,a))
L.sort(key=lambda x:x[1])
print(' '.join(str(l[0]) for l in L))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
a=input().split()
for i in range(0,len(a)):
  a[i]=[int(a[i]),i+1]
a.sort()
for i in range(0,len(a)):
  print(a[i][1])

Submission status: Accepted

Solution code:
import numpy as np
all_students = int(input())
n_students_at = [int(x) for x in input().split()]

n_students_at = np.array(n_students_at, dtype=int)
order = np.argsort(n_students_at)
for i, sid in enumerate(order):
    if i < len(order) - 1:
        print(sid + 1, end=" ")
    else:
        print(sid + 1)

Submission status: Accepted

Solution code:
N = int(input())
A_list = list(map(int, input().split()))
rank_list = [None for _ in range(N)]
for i in range(N):
    rank_list[A_list[i]-1] = i+1
for j in rank_list:
    print(j)

Submission status: Accepted

Solution code:
_ = input()
arrive = {}
n = list(map(int,input().split()))
for i,n in zip(range(len(n)),n):
	arrive[i+1] = n
arrive = sorted(arrive.items(),key=lambda x:x[1])
for ar_tuple in  arrive :
	print(ar_tuple[0],end=" ")
print("")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
N=int(input())
A=list(map(int,input().split()))

B=np.argsort(A)+1

print(' '.join(map(str,B)))

Submission status: Accepted

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

Submission status: Accepted

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

O = [0] * n
for j, a in enumerate(A):
  O[a-1] = j + 1

for x in O:
  print(x, end=" ")
print()

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
ans = [str(x) for x in a]
print(' '.join(ans))

Submission status: Accepted

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

Submission status: Accepted

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


k = sorted(range(0,n),key=lambda x:l[x])
for i in k:
    print(i+1,end= " ")

Submission status: Accepted

Solution code:
import sys

input_line = input()
N= int(input_line)

input_line = input()
student_num = list(map(int,input_line.split()))

buff = [0 for i in range(N)]
for i in range(len(student_num)):
    buff[student_num[i]-1] = i+1
print(' '.join(map(str, buff)))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N=int(input())
A=list(map(int,input().split()))
Alist=[]
for i in range(N):
    Alist.append((i+1,A[i]))
Alist.sort(key=lambda x:x[1])
ans=[str(i[0]) for i in Alist]
ans=" ".join(ans)
print(ans)

Submission status: Accepted

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

r = [None]*n

for i, a in enumerate(a_list, start=1):
  r[a - 1] = str(i)
  
print("{}".format(" ".join(r)))

Submission status: Accepted

Solution code:
n = int(input())
 
ls = list(map(int, input().split()))
ans = []

for i in range(n):
  ans.append(0)
  
for i in range(n):
  ans[ls[i]-1] = i + 1
  
for i in range(n):
  print(ans[i], end = " ")

Submission status: Accepted

Solution code:
import numpy as np
N=int(input()) 
A=list(map(int, input().split()))

A = np.array(A)

ind = np.argsort(A)+1
print(*ind)

Submission status: Accepted

Solution code:

s = input().split()
n=int(s[0])

s=(input().split())

list=[[0 for i in range(2)] for j in range(n)]


for i in range(n):
    list[i][1]=i
    list[i][0]=int(s[i])

list.sort()

#print('list = {}'.format(list))
answer=[]
for i in range(n):
    print(list[i][1]+1)
    #list.append(list[i][1]+1)

#print(answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    A = [(a, i) for i, a in enumerate(map(int, input().split()))]
    A.sort()
    for i in range(n):
        print(A[i][1]+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):
    s = a[i]
    ans[s-1] = i + 1

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
    
for i in range(n):
    print(b[i],end=" ")

Submission status: Accepted

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

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
    
for i in range(n):
    print(b[i],end=" ")

Submission status: Accepted

Solution code:


N=int(input())
A=[int(c) for c in input().split()]
B=sorted([[i+1,A[i]] for i in range(N)],key=lambda x:x[1])
out=""
for b in B:
	out+=str(b[0])+" "
print(out[:-1])

Submission status: Accepted

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

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

ans = [i[1] for i in x]
print(*ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
import sys
input = sys.stdin.readline



def main():
    n = int(input())
    a = list(map(int, input().split()))
    b = np.argsort(a)
    print(*b+1)
    
# main関数呼び出し
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a = int(input())
c=[1 for i in range(a+1)]
b=list(map(int,input().split()))
for n in range(a):
    c[b[n]]=n+1
c.remove(1)
d=map(str,c)
d=" ".join(d)
print(d)

Submission status: Accepted

Solution code:
import numpy as np

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

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

Submission status: Accepted

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

answer = [0]*N

for class_num , order in enumerate(A):
    answer[order - 1] = class_num + 1

print(*answer)

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
dic = {}
for i in range(N):
    dic[A[i]] = i
dic = sorted(dic.items())
for i in dic:
    print("{} ".format(i[1] + 1), end="")

Submission status: Accepted

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

Submission status: Accepted

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
A_key = list()
for i in range(N):
  A_key.append(i+1)
ans_dict = dict(zip(A,A_key))
ans_dict = dict(sorted(ans_dict.items()))
ans_list = list(ans_dict.values())
for i in ans_list:
  print(i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
A_list = [int(x) for x in input().split()]
lst = [-1] * N
for i, A in enumerate(A_list):
    lst[A-1] = i+1
for p in lst:
    print(p, end=' ')
print()

Submission status: Accepted

Solution code:
# ABC C - Go to school


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

for i in range(N):
    Q.append(1)

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

for i in range(N):
    print(Q[i], end = ' ')

print()

Submission status: Accepted

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

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

ans = [a[1] for a in sorted(ans)]

print(*ans)

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, 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())
lst = list(map(int, input().split()))
a = [0]*N
for i,j in enumerate(lst):
    a[j-1] = str(i+1)

print(" ".join(a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

#print(l)
ans = []
for j in range(len(l)):
  if(j!=len(l)):
    print(l[j][0], end=" ")
  else:
    print(l[j][0])

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)
print(" ".join(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

for i in range(N):
	print(B[i],end=" ")

Submission status: Accepted

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

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

B = sorted(B)
for i, x in enumerate(B):
    print(x[1], end = "")
    if i != len(B) - 1:
        print(" ", end = "")
    else:
        print("")

Submission status: Accepted

Solution code:
# coding: utf-8
N = int(input())
A = list(map(int, input().split()))
ans = [[i+1] for i in range(N)]
for i in range(N):
    ans[i].append(A[i])
ans.sort(key=lambda x: x[1])
for i in range(N):
    print(ans[i][0], end=" ")

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)
print(" ".join(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

dic = [0]*n
for i in range(n):
    dic[a[i]-1] = str(i+1)
print(" ".join(dic))

Submission status: Accepted

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

b = list()
for i in range(n+1):
    b.append(0)
    
for i in range(n):
    b[a[i]] = i+1
    
for i in range(1,n+1):
    print(b[i],end=" ")

Submission status: Accepted

Solution code:
from operator import itemgetter
N = int(input())
A = [ int(i) for i in input().split(" ") ]
Z =[]
for i in range(1, N+1):
    Z.append([i, A[i-1]])
Z.sort(key=itemgetter(1))
for i in range(0,N):
    print(Z[i][0],end=" ")

Submission status: Accepted

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

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

print(" ".join(d))

Submission status: Accepted

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

from collections import OrderedDict
od = OrderedDict()

for n,i in enumerate(a):
  od[(n+1)] = i

#print(od)

od_sorted_value = OrderedDict(
    sorted(od.items(), key=lambda x: x[1], reverse=False)
)
#print(od_sorted_value)

ans = list(od_sorted_value.items())
for i,n in ans:
  print(i)

Submission status: Accepted

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

for i in range (n):
    dic[i] = l[i] #{生徒番号: 何人いたか}

dic_sorted = sorted(dic.items(),key=lambda x: x[1])

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

Submission status: Accepted

Solution code:
A=dict(zip(range(1,int(input())+1),list(map(int,input().split()))))
B=sorted(A.items(),key=lambda x:x[1])
for b in B:
    print(b[0],end=" ")

Submission status: Accepted

Solution code:
n=int(input())
a=input().split()
lans=[int(i) for i in range(n)]
sp=' '
ans=''

for i in range(n):
	lans[int(a[i])-1]=i+1
ans+=str(lans[0])
for i in range(1,n):
	ans+=sp
	ans+=str(lans[i])
print(ans)

Submission status: Accepted

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

i = 0
while i < N:
    B[A[i] - 1] = i + 1
    i += 1
    
for i in B:
    print(i, end = ' ')

Submission status: Accepted

Solution code:
N = int(input())
aa = map(int, input().split())
s = sorted([(a, i+1) for i, a in enumerate(aa)])
print(" ".join([str(i) for _, i in s]))

Submission status: Accepted

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

for i in range(n):
    s.append([a[i], i])

s.sort()

for i in range(n):
    print(s[i][1] + 1, end = " ")

Submission status: Accepted

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

Submission status: Accepted

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

dic = dict(zip(range(1, N + 1), A))

sort_dic = sorted(dic.items(), key=lambda x:x[1])

for i in sort_dic:
    print(i[0], end = ' ')

Submission status: Accepted

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

index = 1
dic = {}

for i in A:
    dic[i] = index
    index += 1

sort_dic = sorted(dic.items(), key=lambda x:x[0])

for i in sort_dic:
    print(i[1], end = ' ')

Submission status: Accepted

Solution code:
a =[0]
n=input()
a += list(map(int, input().split()))
print(*sorted(range(1,len(a)), key=a.__getitem__))

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split(' ')))
A_indexed = [(a, index+1) for index, a in enumerate(A)]
A_indexed.sort(key=lambda a_indexed : a_indexed[0])
print(' '.join('{}'.format(a_indexed[1]) for a_indexed in A_indexed))

Submission status: Accepted

Solution code:
a = int(input())
h = list(map(int,input().split()))
ans = sorted(range(len(h)), key=lambda k: h[k])
for i in range(a):
  print(ans[i]+1, end=" ")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import numpy as np

n = int(input())
a = np.array(input().split(), dtype='int')

ans = np.empty(n, dtype='int')

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

print(*ans)

Submission status: Accepted

Solution code:
import numpy as np

N = int(input())
A = np.array([int(x) for x in input().split()])

print(" ".join([str(a + 1) for a in np.argsort(A)]))

Submission status: Accepted

Solution code:
import heapq

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

heap = list()
heapq.heapify(heap)
for i in range(n):
    heapq.heappush(heap, (lst[i], i))
res = ''
for i in range(n):
    a,b = heapq.heappop(heap)
    res += str(b+1) + ' '
print(res[:-1])

Submission status: Accepted

Solution code:
N = int(input())
order = [int(x) for x in input().split()]
order_sorted = sorted(range(len(order)), key=lambda k: order[k])
order_sorted = [x+1 for x in order_sorted]
print(*order_sorted)

Submission status: Accepted

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


N=int(input())
A = [[] for _ in range(N)]
a = list(map(int, input().split()))
for i in range(1,N+1):
    A[i-1].append(i)
    A[i-1].append(a[i-1])

A.sort(key=lambda x: x[1])
for i in range(N):
    print(A[i][0], end=" ")

Submission status: Accepted

Solution code:
n = int(input())
a = map(int, input().strip().split())
index = 1
dic = {}
for i in a:
    dic[i] = index
    index += 1
sort_dic = sorted(dic.items(),key=lambda x:x[0])
for i in sort_dic:
    print(i[1], end = ' ')

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
ans = sorted(range(N), key=lambda i: A[i])
ans = list(map(lambda x: str(x + 1), ans))
print(' '.join(ans))

Submission status: Accepted

Solution code:
N = int(input())
A = [int(y) for y in input().split()]
dictA = {}

for i in range(len(A)):
    dictA[A[i]] = i + 1
sdictA = sorted(dictA.items())

for i in sdictA:
    print(i[1], end=" ")

Submission status: Accepted

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

dic={}
for i in range(N):
  dic[alist[i]]=i+1
  
ans_list=[]
for i in range(1,N+1):
  ans_list.append(str(dic[i]))

print(" ".join(ans_list))

Submission status: Accepted

Solution code:
import numpy as np

N = int(input())
A = [int(i) for i in input().split()]
arr = np.arange(N) 
for i in range(N):
    arr[A[i]-1] = i+1
for i in range(N):   
    print(arr[i],end=" ")

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())
elems = list(map(int, input().split()))

ranges = [i for i in range(1, len(elems)+1)]
myElems = zip(elems, ranges)
newElems = sorted(myElems, key=lambda x: x[0])


res = []
for _,i in newElems:
	res.append(i)
print(*res)

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())
l=list(map(int,input().split()))
b=[0]*n
for i,r in enumerate(l,0):
  c=r-1
  b[c]=i+1
c=[str(a) for a in b]
d=' '.join(c)
print(d)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
lst = input().split(" ")

dic = {}
for i, l in enumerate(lst):
  dic[int(l)] = i+1

ll = []
for i in range(1, n+1):
  ll.append(str(dic[i]))
  
answer = " ".join(ll)
print(answer)

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):
    idx = A[i]-1
    ans[idx] = str(i+1)
print(" ".join(ans))

Submission status: Accepted

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

a_to_i = {a: i + 1 for i, a in enumerate(al)}

al.sort()

print(' '.join(str(a_to_i[a]) for a in al))

Submission status: Accepted

Solution code:
N=int(input())
A=list(map(int,input().split()))
a=[[] for i in range(N)]
for i in range(N):
  a[i]=[i+1,A[i]]
a=sorted(a,key=lambda x:x[1])
for i in range(N):
  print(a[i][0],end='')
  print(' ',end='')

Submission status: Accepted

Solution code:
N = int(input())
A = [int(x) for x in input().split()]
ans_list = [0]*N
for i, j in enumerate(A, 1): #enumerate -> インデックス番号、要素の順に取得
  ans_list[j - 1] = i

print(' '.join(map(str, ans_list)))

Submission status: Accepted

Solution code:
import sys
printn = lambda x: sys.stdout.write(x)
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split()) 
DBG = True # and False

def ddprint(x):
  if DBG:
    print(x)

n = inn()
a = inl()
b = [(a[i],i) for i in range(n)]
b.sort()
for i in range(n):
  printn(str(b[i][1]+1))
  printn(' ')
print("")

Submission status: Accepted

Solution code:
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

def LI(): return list(map(int, sys.stdin.readline().split()))

N = int(input())
A = LI()

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

aA = sorted(aA, key = lambda x:x[1])
for i in range(N):
    print(aA[i][0],end="")
    print(" ",end="")
print("")

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
students = []
for i in range(n):
  student = dict(num=i+1, people=a[i])
  students.append(student)
students.sort(key=lambda x:x['people'])
answer = [student.get('num') for student in students]
for ans in answer:
  print(ans, end=' ')

Submission status: Accepted

Solution code:
import sys,os,math
from collections import Counter, defaultdict, deque
import bisect
from sys import stdin, stdout
from itertools import repeat


# sys.stdin = open('input')
# n, k = map(int, raw_input().split())
# da = map(int, raw_input().split())
# db = map(int, raw_input().split())


def solve():

    pass

def main():
    n = map(int, raw_input().split())[0]
    da = map(int, raw_input().split())
    l = []
    for idx, da in enumerate(da):
        l.append((da, idx+1))
    l.sort()
    # print map(lambda x: x[-1], l)
    print ' '.join(map(lambda x: str(x[-1]), l))



main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
A = [int(i) for i in 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 = [int(i) for i in input().split()]
dic = {}
for i, j in enumerate(A):
    dic[j] = i + 1
for k in range(1, N + 1):
    print(dic[k], end = " ")

Submission status: Accepted

Solution code:
N = int(input())
nu = [int(x) for x in input().split()]
r2 = [None] * N
 
for i in range(len(nu)):
  r2[nu[i] - 1] = i
#for i in nu:
#  r2[i] = nu.index(i)
ans = ""
for i in range(len(r2)):
  ans += str(r2[i] + 1) + " "
print(ans)
#print(" ".join([str(x + 1) for x in r2]))

Submission status: Accepted

Solution code:
N = int(input())
nu = [int(x) for x in input().split()]
r2 = [None] * N

for i in range(len(nu)):
  r2[nu[i] - 1] = i
#for i in nu:
#  r2[i] = nu.index(i)
print(" ".join([str(x + 1) for x in r2]))

Submission status: Accepted

Solution code:
import numpy as np
n=int(input())
a=[int(x) for x in input().split()]
x=np.array(a)
for i in np.argsort(x):
  print(i+1,end=" ")

Submission status: Accepted

Solution code:
# 1行目の入力を数値として扱う
n = int(input())
# 2行目の入力を数値のリストとして扱う
a = list(map(int, input().split()))

# 文字列の長さ分の配列を用意
ans = [0] * n

# 配列の添え字と中身を逆転させる
for i in range(1, n + 1):
    n = a[i - 1]
    ans[n - 1] = str(i)

# 答えの出力(リストの括弧を出力しない工夫)
print(' '.join(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
  n = int(input())
  a = [int(x) for x in input().split()]
  ls = [[0,int(x)+1] for x in range(n)]
  for i in range(n):
    ls[i][0] = a[i]
  ls = sorted(ls,key = lambda x:x[0])
  for i in range(n):
    print(ls[i][1],end=" ")
  print("\n")

if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
def t(a):
    return " ".join([str(j + 1) for i, j in sorted([(j, i) for i, j in enumerate(a)])])


if __name__ == "__main__":
    n = int(input())
    a = list(map(int, input().split()))
    print(t(a))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n=int(input())
l=map(int, input().split())
A=[[i+1, rank] for i, rank in enumerate(l)]
A = sorted(A, key=lambda x:x[1])
print(" ".join(map(lambda x:str(x[0]), A)))

Submission status: Accepted

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

l = []
for i, x in enumerate(a, 1):
    l.append((x, i))

y = sorted(l)
for z, i in y:
    print(i, end=' ')

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:
N=int(input())
A=list(map(int,input().split()))
B=[0]*N
for i in range (0,N):
    
    B[A[i]-1]=i+1
    
print(*B)

Submission status: Accepted

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

print(' '.join(map(str,V)))

Submission status: Accepted

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

_n = int(input())
nlist = [item for item in map(int, input().split())]
jlist = [i for i in range(1, _n + 1)]

slist = sorted(zip(nlist, jlist))
slist = [item[1] for item in slist]
print(*slist)

Submission status: Accepted

Solution code:
N = int(input())
students = list(map(int, input().split()))
seat_num = {}
for i,student in enumerate(students ,1):
    seat_num[i] = student
seat_num_sort = sorted(seat_num.items(), key =lambda x: x[1])
seat_result = [s[0] for s in seat_num_sort]
print(' '.join(map(str, seat_result)))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(N: int, A: "List[int]"):
    ans = [0]*N
    for i, a in enumerate(A, 1):
        ans[a-1] = i
    print(' '.join(map(str, ans)))
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    A = [int(next(tokens)) for _ in range(N)]  # type: "List[int]"
    solve(N, A)


if __name__ == '__main__':
    main()

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()
c = [b[i][1] for i in range(n)]
print(*c)

Submission status: Accepted

Solution code:
N = int(input())
A = []#生徒たちが出席した順番
rev = [0]*N #早く来た順の生徒の番号

for x in input().split():
    A.append(int(x))

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

print(' '.join(map(str,rev)))

Submission status: Accepted

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

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

for i in range(N):
	print(B[i])

Submission status: Accepted

Solution code:

N = int(input())
I = input().split()
A = []
for i in range(N):
    A.append([int(I[i]),i,])

b = sorted(A,key=lambda A :A[0])

print(b[0][1]+1, end=" ")

if N > 2:
    for i in range(1,N-1):
        print(b[i][1]+1, end=" ")

if N > 1:        
    print(b[N-1][1]+1, end =" ")

Submission status: Accepted

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

for i in range(N):
    num = lis[i] - 1
    first[num] = i

for i in range(N):
    print(first[i]+1,end=' ')
print()

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
for i in range(n):
    print(ans[i],end=" ")

Submission status: Accepted

Solution code:
n = int(input())
ar = list(map(int, input().split()))
result = [0] * (n + 1)
for index, elm in enumerate(ar):
    result[elm] = index + 1
print(*result[1:])

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc142/tasks/abc142_c
n = int(input())
a = list(map(int, input().split()))
#### TLE ####
# ans = [str(a.index(i + 1) + 1) for i in range(n)]
# print(" ".join(ans))

b = [" "] * n
for i in range(n):
    b[a[i]-1] = str(i+1)

print(" ".join(b))