CF1509A.Average Height

入门

通过率:0%

时间限制:1.00s

内存限制:256MB

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Sayaka Saeki is a member of the student council, which has nn other members (excluding Sayaka). The ii-th member has a height of aia_i millimeters.

It's the end of the school year and Sayaka wants to take a picture of all other members of the student council. Being the hard-working and perfectionist girl as she is, she wants to arrange all the members in a line such that the amount of photogenic consecutive pairs of members is as large as possible.

A pair of two consecutive members uu and vv on a line is considered photogenic if their average height is an integer, i.e. au+av2\frac{a_u + a_v}{2} is an integer.

Help Sayaka arrange the other members to maximize the number of photogenic consecutive pairs.

佐藤沙耶香是学生会的一员,学生会中除她之外还有 nn 名成员。第 ii 名成员的身高为 aia_i 毫米。

学年即将结束,沙耶香希望为学生会其他所有成员拍摄一张合影。作为一名勤奋且追求完美的女孩,她希望将所有成员排成一列,使得“上镜的”相邻成员对的数量尽可能多。

若一行中两个相邻成员 uu 和 vv 的平均身高为整数,即 au+av2\frac{a_u + a_v}{2} 为整数,则称该相邻对 (u,v)(u, v) 是“上镜的”。

请帮助沙耶香安排其余成员,以最大化上镜的相邻成员对的数量。

输入格式

The first line contains a single integer tt (1≤t≤5001\le t\le 500) — the number of test cases.

The first line of each test case contains a single integer nn (2≤n≤20002 \le n \le 2000) — the number of other council members.

The second line of each test case contains nn integers a1a_1, a2a_2, ..., ana_n (1≤ai≤2⋅1051 \le a_i \le 2 \cdot 10^5) — the heights of each of the other members in millimeters.

It is guaranteed that the sum of nn over all test cases does not exceed 20002000.

第一行包含一个整数 tt(1≤t≤5001\le t\le 500)——测试用例的数量。

每个测试用例的第一行包含一个整数 nn(2≤n≤20002 \le n \le 2000)——其他理事会成员的数量。

每个测试用例的第二行包含 nn 个整数 a1a_1, a2a_2, ..., ana_n(1≤ai≤2⋅1051 \le a_i \le 2 \cdot 10^5)——其余每位成员的身高(单位:毫米)。

保证所有测试用例中 nn 的总和不超过 20002000。

输出格式

For each test case, output on one line nn integers representing the heights of the other members in the order, which gives the largest number of photogenic consecutive pairs. If there are multiple such orders, output any of them.

对于每个测试用例,在一行中输出 nn 个整数,表示其他成员的高度顺序,该顺序使得“上镜的连续对”数量最大。若存在多个满足条件的顺序,输出其中任意一个即可。

输入输出样例

  • 输入#1

    4
    3
    1 1 2
    3
    1 1 1
    8
    10 9 13 15 3 16 9 13
    2
    18 9

    输出#1

    1 1 2 
    1 1 1 
    13 9 13 15 3 9 16 10 
    9 18

说明/提示

In the first test case, there is one photogenic pair: (1,1)(1, 1) is photogenic, as 1+12=1\frac{1+1}{2}=1 is integer, while (1,2)(1, 2) isn't, as 1+22=1.5\frac{1+2}{2}=1.5 isn't integer.

In the second test case, both pairs are photogenic.

在第一个测试用例中,存在一个上镜的数对:(1,1)(1, 1) 是上镜的,因为 1+12=1\frac{1+1}{2}=1 是整数;而 (1,2)(1, 2) 不是上镜的,因为 1+22=1.5\frac{1+2}{2}=1.5 不是整数。

在第二个测试用例中,两个数对都是上镜的。

输入解题思路,AI测评打分。不知道怎么写?

首页