| Task: | Pair sort |
| Sender: | aalto26dw_003 |
| Submission time: | 2026-09-23 17:45:59 +0300 |
| Language: | Python3 (PyPy3) |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.04 s | details |
| #2 | ACCEPTED | 0.04 s | details |
| #3 | ACCEPTED | 0.04 s | details |
| #4 | ACCEPTED | 0.04 s | details |
| #5 | ACCEPTED | 0.04 s | details |
| #6 | ACCEPTED | 0.04 s | details |
| #7 | ACCEPTED | 0.04 s | details |
| #8 | ACCEPTED | 0.04 s | details |
| #9 | ACCEPTED | 0.04 s | details |
| #10 | ACCEPTED | 0.04 s | details |
| #11 | ACCEPTED | 0.05 s | details |
| #12 | ACCEPTED | 0.05 s | details |
| #13 | ACCEPTED | 0.07 s | details |
| #14 | ACCEPTED | 0.07 s | details |
Code
import sys
input = sys.stdin.read().split()
n = int(input[0])
a = [int(x) for x in input[1:]]
idx = [[] for _ in range(n+1)]
for i,val in enumerate(a) :
idx[val].append(i)
steps = []
for i in range(n):
p1 = 2*i
p2 = 2*i +1
if a[p1] == a[p2]:
continue
x = a[p1]
y = a[p2]
p3 = idx[x][1] if idx[x][0] == p1 else idx[x][0]
steps.append((p2+1,p3+1))
a[p2], a[p3] = a[p3], a[p2]
if idx[y][0] == p2 :
idx[y][0] = p3
else :
idx[y][1] = p3
print(len(steps))
for s in steps :
print(f"{s[0]} {s[1]}")Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 5 3 2 4 5 1 3 2 1 4 5 |
| correct output |
|---|
| 3 2 6 4 9 6 8 |
| user output |
|---|
| 3 2 6 4 9 6 8 |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 5 3 2 4 5 1 3 2 1 4 5 |
| correct output |
|---|
| 3 2 6 4 9 6 8 |
| user output |
|---|
| 3 2 6 4 9 6 8 |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 10 3 6 6 8 8 9 9 1 4 5 2 4 10 2 1... |
| correct output |
|---|
| 9 2 17 4 17 6 17 8 17 ... |
| user output |
|---|
| 9 2 17 4 17 6 17 8 17 ... |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 10 3 6 6 8 8 9 9 1 4 5 2 4 10 2 1... |
| correct output |
|---|
| 9 2 17 4 17 6 17 8 17 ... |
| user output |
|---|
| 9 2 17 4 17 6 17 8 17 ... |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 50 47 26 6 35 13 18 9 19 14 50 34... |
| correct output |
|---|
| 48 2 87 4 78 6 71 8 55 ... |
| user output |
|---|
| 48 2 87 4 78 6 71 8 55 ... |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 50 47 26 6 35 13 18 9 19 14 50 34... |
| correct output |
|---|
| 48 2 87 4 78 6 71 8 55 ... |
| user output |
|---|
| 48 2 87 4 78 6 71 8 55 ... |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 100 56 26 6 35 60 72 9 55 83 51 58... |
| correct output |
|---|
| 97 2 77 4 108 6 141 8 55 ... |
| user output |
|---|
| 97 2 77 4 108 6 141 8 55 ... |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 100 56 26 6 35 60 72 9 55 83 51 58... |
| correct output |
|---|
| 97 2 77 4 108 6 141 8 55 ... |
| user output |
|---|
| 97 2 77 4 108 6 141 8 55 ... |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 500 56 146 351 35 281 235 354 449 ... |
| correct output |
|---|
| 497 2 758 4 820 6 125 8 243 ... |
| user output |
|---|
| 497 2 758 4 820 6 125 8 243 ... |
Test 10
Verdict: ACCEPTED
| input |
|---|
| 500 56 146 351 35 281 235 354 449 ... |
| correct output |
|---|
| 497 2 758 4 820 6 125 8 243 ... |
| user output |
|---|
| 497 2 758 4 820 6 125 8 243 ... |
Test 11
Verdict: ACCEPTED
| input |
|---|
| 1000 603 596 351 885 530 235 354 56... |
| correct output |
|---|
| 993 2 256 4 1534 6 816 8 1057 ... |
| user output |
|---|
| 993 2 256 4 1534 6 816 8 1057 ... |
Test 12
Verdict: ACCEPTED
| input |
|---|
| 1000 603 596 351 885 530 235 354 56... |
| correct output |
|---|
| 993 2 256 4 1534 6 816 8 1057 ... |
| user output |
|---|
| 993 2 256 4 1534 6 816 8 1057 ... |
Test 13
Verdict: ACCEPTED
| input |
|---|
| 5000 1594 596 1797 3776 1201 235 35... |
| correct output |
|---|
| 4993 2 1548 4 9062 6 6397 8 8296 ... |
| user output |
|---|
| 4993 2 1548 4 9062 6 6397 8 8296 ... |
Test 14
Verdict: ACCEPTED
| input |
|---|
| 5000 1594 596 1797 3776 1201 235 35... |
| correct output |
|---|
| 4993 2 1548 4 9062 6 6397 8 8296 ... |
| user output |
|---|
| 4993 2 1548 4 9062 6 6397 8 8296 ... |
