1971G - XOUR - CodeForces Solution


data structures dsu sortings

Please click on ads to support us..

Python Code:

from collections import *

from sys import *
input=stdin.readline

def outl(l):
    print(' '.join(map(str,l)))

def yes():
    print('YES')

def no():
    print('NO')

def solve():
    n=int(input())
        l=list(map(int,input().split()))
    d=defaultdict(list)
    for i in range(n):
        d[l[i]//4*4].append(l[i])
    for i in d:
        d[i].sort(reverse=True)
    l1=[]
    for i in range(n):
        l1.append(d[l[i]//4*4].pop())
    outl(l1)

for _ in range(int(input())):
    solve()


Comments

Submit
0 Comments
More Questions

680B - Bear and Finding Criminals
1036E - Covered Points
1015D - Walking Between Houses
155B - Combination
1531A - Зингер | color
1678A - Tokitsukaze and All Zero Sequence
896A - Nephren gives a riddle
761A - Dasha and Stairs
1728B - Best Permutation
1728A - Colored Balls Revisited
276B - Little Girl and Game
1181A - Chunga-Changa
1728C - Digital Logarithm
1728D - Letter Picking
792B - Counting-out Rhyme
1195A - Drinks Choosing
5D - Follow Traffic Rules
1272A - Three Friends
1632D - New Year Concert
1400D - Zigzags
716C - Plus and Square Root
412A - Poster
844B - Rectangles
1591A - Life of a Flower
1398C - Good Subarrays
629A - Far Relative’s Birthday Cake
1166A - Silent Classroom
1000B - Light It Up
218B - Airport
1463B - Find The Array