Submission #52593619

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#ABC350_20240420_C
N=int(input())
A=list(map(int,input().split()))
D={}
for i in range(N):
    D[A[i]]=i+1
ans=[]
#print(D)
#D K=数字、値=A上の位置
for i in range(N-1):
    #print(A[i],i+1)
    if(A[i]!=i+1): #Aの位置と値にずれがあったら
        #本操作で元(i+1)と先(D[i+1])を入れ替える
        #MOTOV(A[i])SAKIV(A[D[i]])
        #MOTOP(i+1),SAKIP(D[A[i]])
        #MOTOP=i+1
        SAKIP=D[i+1]
        MOTOV=A[i]
        SAKIV=A[SAKIP-1]
        #print(i+1,SAKIP,MOTOV,SAKIV)
        ans.append((i+1,SAKIP))
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#ABC350_20240420_C
N=int(input())
A=list(map(int,input().split()))
D={}
for i in range(N):
    D[A[i]]=i+1
ans=[]
#print(D)
#D K=数字、値=A上の位置
for i in range(N-1):
    #print(A[i],i+1)
    if(A[i]!=i+1): #Aの位置と値にずれがあったら
        #本操作で元(i+1)と先(D[i+1])を入れ替える
        #MOTOV(A[i])SAKIV(A[D[i]])
        #MOTOP(i+1),SAKIP(D[A[i]])
        #MOTOP=i+1
        SAKIP=D[i+1]
        MOTOV=A[i]
        SAKIV=A[SAKIP-1]
        #print(i+1,SAKIP,MOTOV,SAKIV)
        ans.append((i+1,SAKIP))
        #Aの書き換え
        A[i]=SAKIV
        A[SAKIP-1]=MOTOV
        #Dの書き換え
        D[MOTOV]=SAKIP
        D[SAKIV]=i+1
        #print(D)
        #print(A)
print(len(ans))
for x,y in ans:
    print(x,y)
#print(A)

Submission Info

Judge Result