/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 36ms 17.398 MiB
#2 Accepted 45ms 18.219 MiB

Code

import sys

input = lambda: sys.stdin.readline().strip()

def print(value):
    sys.stdout.write(str(value) + '\n')

def printl(l):
    print(' '.join(str(y) for y in l))

def rl():
    return(map(int,input().split()))

for _ in range(int(input())):
    n=int(input())
    p=[]

    if n%2:
        for i in range(n//2-1):
            p.append(2*i+2)
            p.append(2*i+1)
        p.append(n-1)
        p.append(n)
        p.append(n-2)
    else:
        for i in range(n//2):
            p.append(2*i+2)
            p.append(2*i+1)
    
    printl(p)

Information

Submit By
Type
Submission
Problem
P1210 A. Smallest Permutation
Contest
Educational Round 1
Language
PyPy 3 (Python 3.9.18 PyPy 7.3.15)
Submit At
2025-07-14 15:34:48
Judged At
2025-07-14 15:34:48
Judged By
Score
100
Total Time
45ms
Peak Memory
18.219 MiB