Submission #366304

#	Time	Username	Problem	Language	Result	Execution time	Memory
366304		model_code	Xor Sort (eJOI20_xorsort)	Cpython 3	0 / 100	16 ms	3052 KiB

xorsort

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

operations = []

for i in range(N):
  for j in range(N-i):
    if A[j] > A[j+1]:
      operations.append((j,j+1))
      operations.append((j+1,j))
      operations.append((j,j+1))
      A[j], A[j+1] = A[j+1], A[j]

print(len(operations))
for i, j in operations: print(i+1, j+1)

• Subtask 1: 0 / 25
• Subtask 2: 0 / 35
• Subtask 3: 0 / 40